-
3
-
-
0036215402
-
Treewidth and minimum fill-in: Grouping the minimal separators
-
Bouchitté V., Todinca I. Treewidth and minimum fill-in. grouping the minimal separators SIAM J. Comput. 31(1):2001;212-232.
-
(2001)
SIAM J. Comput.
, vol.31
, Issue.1
, pp. 212-232
-
-
Bouchitté, V.1
Todinca, I.2
-
4
-
-
0037029296
-
Listing all potential maximal cliques of a graph
-
Bouchitté V., Todinca I. Listing all potential maximal cliques of a graph. Theoret. Comput. Sci. 276(1-2):2002;17-32.
-
(2002)
Theoret. Comput. Sci.
, vol.276
, Issue.1-2
, pp. 17-32
-
-
Bouchitté, V.1
Todinca, I.2
-
6
-
-
85137859893
-
Subgraph isomorphism in planar graphs and related problems
-
Eppstein D. Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3):1999;1-27.
-
(1999)
J. Graph Algorithms Appl.
, vol.3
, Issue.3
, pp. 1-27
-
-
Eppstein, D.1
-
8
-
-
84956981238
-
Treewidth of circle graphs
-
Proceedings of the Fourth Annual International Symposium on Algorithms and Computation (ISAAC'93), Springer, Berlin
-
T. Kloks, Treewidth of circle graphs, in: Proceedings of the Fourth Annual International Symposium on Algorithms and Computation (ISAAC'93), Lecture Notes in Computer Science, Vol. 762, Springer, Berlin, 1993, pp. 108-117.
-
(1993)
Lecture Notes in Computer Science
, vol.762
, pp. 108-117
-
-
Kloks, T.1
-
9
-
-
0001162493
-
Treewidth of chordal bipartite graphs
-
Kloks T., Kratsch D. Treewidth of chordal bipartite graphs. J. Algorithms. 19(2):1995;266-281.
-
(1995)
J. Algorithms
, vol.19
, Issue.2
, pp. 266-281
-
-
Kloks, T.1
Kratsch, D.2
-
10
-
-
84947735120
-
Approximating the bandwidth for asteroidal triple-free graphs
-
Proceedings of the Third Annual European Symposium on Algorithms (ESA'95) Springer, Berlin
-
T. Kloks, D. Kratsch, H. Müller, Approximating the bandwidth for asteroidal triple-free graphs, in: Proceedings of the Third Annual European Symposium on Algorithms (ESA'95), Lecture Notes in Computer Science, Vol. 979, Springer, Berlin, 1995, pp. 434-447.
-
(1995)
Lecture Notes in Computer Science
, vol.979
, pp. 434-447
-
-
Kloks, T.1
Kratsch, D.2
Müller, H.3
-
12
-
-
0000865792
-
Characterizations and algorithmic applications of chordal graph embeddings
-
Parra A., Scheffler P. Characterizations and algorithmic applications of chordal graph embeddings. Discrete Appl. Math. 79(1-3):1997;171-188.
-
(1997)
Discrete Appl. Math.
, vol.79
, Issue.1-3
, pp. 171-188
-
-
Parra, A.1
Scheffler, P.2
-
14
-
-
0000673493
-
Graphs minors. II. Algorithmic aspects of tree-width
-
Robertson N., Seymour P. Graphs minors. II. Algorithmic aspects of tree-width. J. Algorithms. 7:1986;309-322.
-
(1986)
J. Algorithms
, vol.7
, pp. 309-322
-
-
Robertson, N.1
Seymour, P.2
-
15
-
-
0038521887
-
Call routing and the ratcatcher
-
Seymour P.D., Thomas R. Call routing and the ratcatcher. Combinatorica. 14(2):1994;217-241.
-
(1994)
Combinatorica
, vol.14
, Issue.2
, pp. 217-241
-
-
Seymour, P.D.1
Thomas, R.2
|