Result 1 to 10 from 10 total
Geometry of maximum likelihood estimation in Gaussian graphical models. (English)
Ann. Stat. 40, No. 1, 238-261 (2012).
1
Weighted maximum-clique transversal sets of graphs. (English)
ISRN Discrete Math. 2011, Article ID 540834, 20 p., electronic only (2011).
2
Improved algorithms and complexity results for power domination in graphs. (English)
Algorithmica 52, No. 2, 177-202 (2008).
3
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. (English)
J. Comput. Syst. Sci. 69, No. 2, 166-195 (2004).
4
Memory requirements for table computations in partial $k$-tree algorithms. (English)
Algorithmica 27, No.3-4, 382-394 (2000).
5
Graph decomposition of slim graphs. (English)
Graphs Comb. 15, No.1, 5-19 (1999).
6
Rankings of graphs. (English)
SIAM J. Discrete Math. 11, No.1, 168-181 (1998).
7
An algebraic theory of graph reduction. (English)
J. Assoc. Comput. Mach. 40, No.5, 1134-1164 (1993).
8
Easy problems for tree-decomposable graphs. (English)
J. Algorithms 12, No.2, 308-340 (1991).
9
Some classes of graphs with bounded treewidth. (English)
Bull. EATCS 36, 116-126 (1988).
10
Result 1 to 10 from 10 total
Start
Contact
Print
General Help
