-
1
-
-
0000849902
-
Finite automata, bounded treewidth, and well-quasiordering
-
American Mathematical Society
-
Abrahamson K.A., and Fellows M.R. Finite automata, bounded treewidth, and well-quasiordering. Graph Structure Theory, Contemporary Mathematics 147 (1993), American Mathematical Society 539-564
-
(1993)
Graph Structure Theory, Contemporary Mathematics 147
, pp. 539-564
-
-
Abrahamson, K.A.1
Fellows, M.R.2
-
2
-
-
0042305729
-
Problems easy for tree-decomposible graphs
-
Proc. 15th Colloq. Automata, Languages and Programming, Springer, Berlin
-
Arnborg S., Lagergren J., and Seese D. Problems easy for tree-decomposible graphs. Proc. 15th Colloq. Automata, Languages and Programming. Lecture Notes in Comput. Sci. vol. 317 (1988), Springer, Berlin 38-51
-
(1988)
Lecture Notes in Comput. Sci.
, vol.317
, pp. 38-51
-
-
Arnborg, S.1
Lagergren, J.2
Seese, D.3
-
4
-
-
77649271402
-
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
-
Bui-Xuan B.-M., Telle J.A., and Vatshelle M. H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Appl. Math. 158 7 (2010) 809-819
-
(2010)
Discrete Appl. Math.
, vol.158
, Issue.7
, pp. 809-819
-
-
Bui-Xuan, B.-M.1
Telle, J.A.2
Vatshelle, M.3
-
5
-
-
24344452559
-
On the relationship between cliquewidth and treewidth
-
Corneil D.G., and Rotics U. On the relationship between cliquewidth and treewidth. SIAM J. Comput. 34 4 (2005) 825-847
-
(2005)
SIAM J. Comput.
, vol.34
, Issue.4
, pp. 825-847
-
-
Corneil, D.G.1
Rotics, U.2
-
6
-
-
0025398865
-
The monadic second-order logic of graphs I. Recognizable sets of Finite Graphs.
-
Courcelle B. The monadic second-order logic of graphs I. Recognizable sets of Finite Graphs. Inform. Comput. 85 (1990) 12-75
-
(1990)
Inform. Comput.
, vol.85
, pp. 12-75
-
-
Courcelle, B.1
-
7
-
-
38549177883
-
Graph operations characterizing rank-width and balanced graph expressions
-
Graph-theoretic Concepts in Computer Science, Springer, Berlin
-
Courcelle B., and Kanté M.M. Graph operations characterizing rank-width and balanced graph expressions. Graph-theoretic Concepts in Computer Science. Lecture Notes in Comput. Sci. vol. 4769 (2007), Springer, Berlin 66-75
-
(2007)
Lecture Notes in Comput. Sci.
, vol.4769
, pp. 66-75
-
-
Courcelle, B.1
Kanté, M.M.2
-
8
-
-
59749102166
-
Graph operations characterizing rank-width
-
Courcelle B., and Kanté M.M. Graph operations characterizing rank-width. Discrete Appl. Math. 157 4 (2009) 627-640
-
(2009)
Discrete Appl. Math.
, vol.157
, Issue.4
, pp. 627-640
-
-
Courcelle, B.1
Kanté, M.M.2
-
9
-
-
0034399867
-
Linear time solvable optimization problems on graphs of bounded clique-width
-
Courcelle B., Makowsky J.A., and Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33 2 (2000) 125-150
-
(2000)
Theory Comput. Syst.
, vol.33
, Issue.2
, pp. 125-150
-
-
Courcelle, B.1
Makowsky, J.A.2
Rotics, U.3
-
10
-
-
0002015577
-
Upper bounds to the clique width of graphs
-
Courcelle B., and Olariu S. Upper bounds to the clique width of graphs. Discrete Appl. Math. 101 1-3 (2000) 77-114
-
(2000)
Discrete Appl. Math.
, vol.101
, Issue.1-3
, pp. 77-114
-
-
Courcelle, B.1
Olariu, S.2
-
12
-
-
84945303807
-
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time
-
Graph-theoretic Concepts in Computer Science, Springer, Berlin
-
Espelage W., Gurski F., and Wanke E. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. Graph-theoretic Concepts in Computer Science. Lecture Notes in Comput. Sci. vol. 2204 (2001), Springer, Berlin 117-128
-
(2001)
Lecture Notes in Comput. Sci.
, vol.2204
, pp. 117-128
-
-
Espelage, W.1
Gurski, F.2
Wanke, E.3
-
13
-
-
8344256696
-
The complexity of first-order and monadic second-order logic revisited
-
Frick M., and Grohe M. The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 130 (2004) 3-31
-
(2004)
Ann. Pure Appl. Logic
, vol.130
, pp. 3-31
-
-
Frick, M.1
Grohe, M.2
-
14
-
-
77649270626
-
-
Master thesis. Faculty of Informatics of the Masaryk University, Brno, Czech republic
-
R. Ganian, Automata formalization for graphs of bounded rank-width. Master thesis. Faculty of Informatics of the Masaryk University, Brno, Czech republic, 2008
-
(2008)
Automata formalization for graphs of bounded rank-width
-
-
Ganian, R.1
-
15
-
-
77649275477
-
Automata approach to graphs of bounded rank-width
-
R. Ganian, P. Hliněný, Automata approach to graphs of bounded rank-width, in: IWOCA 2008, proceedings, 2008, pp. 4-15
-
(2008)
IWOCA 2008, proceedings
, pp. 4-15
-
-
Ganian, R.1
Hliněný, P.2
-
16
-
-
72249114625
-
-
R. Ganian, P. Hliněný, Better polynomial algorithms on graphs of bounded rank-width, in: IWOCA 2009, in: Lecture Notes in Comput. Sci. (in press)
-
R. Ganian, P. Hliněný, Better polynomial algorithms on graphs of bounded rank-width, in: IWOCA 2009, in: Lecture Notes in Comput. Sci. (in press)
-
-
-
-
17
-
-
0037453456
-
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
-
Gerber M.U., and Kobler D. Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoret. Comput. Sci. 299 1-3 (2003) 719-734
-
(2003)
Theoret. Comput. Sci.
, vol.299
, Issue.1-3
, pp. 719-734
-
-
Gerber, M.U.1
Kobler, D.2
-
18
-
-
0002210679
-
The number of subspaces of a vector space
-
Tutte. W.T. (Ed), Academic Press
-
Goldman J., and Rota G.-C. The number of subspaces of a vector space. In: Tutte. W.T. (Ed). Recent Progress in Combinatorics (1969), Academic Press 75-83
-
(1969)
Recent Progress in Combinatorics
, pp. 75-83
-
-
Goldman, J.1
Rota, G.-C.2
-
19
-
-
33645920646
-
Branch-width, parse trees, and monadic second-order logic for matroids
-
Hliněný P. Branch-width, parse trees, and monadic second-order logic for matroids. J. Combin. Theory Ser. B 96 3 (2006) 325-351
-
(2006)
J. Combin. Theory Ser. B
, vol.96
, Issue.3
, pp. 325-351
-
-
Hliněný, P.1
-
20
-
-
55249112968
-
Finding branch-decomposition and rank-decomposition
-
Hliněný P., and Oum S. Finding branch-decomposition and rank-decomposition. SIAM J. Comput. 38 (2008) 1012-1032
-
(2008)
SIAM J. Comput.
, vol.38
, pp. 1012-1032
-
-
Hliněný, P.1
Oum, S.2
-
21
-
-
84867942957
-
Edge dominating set and colorings on graphs with fixed clique-width
-
Kobler D., and Rotics U. Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126 2-3 (2003) 197-221
-
(2003)
Discrete Appl. Math.
, vol.126
, Issue.2-3
, pp. 197-221
-
-
Kobler, D.1
Rotics, U.2
-
22
-
-
23244468510
-
Rank-width and vertex-minors
-
Oum S. Rank-width and vertex-minors. J. Combin. Theory Ser. B 95 1 (2005) 79-100
-
(2005)
J. Combin. Theory Ser. B
, vol.95
, Issue.1
, pp. 79-100
-
-
Oum, S.1
-
23
-
-
32544455938
-
Approximating clique-width and branch-width
-
Oum S., and Seymour P. Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96 4 (2006) 514-528
-
(2006)
J. Combin. Theory Ser. B
, vol.96
, Issue.4
, pp. 514-528
-
-
Oum, S.1
Seymour, P.2
-
24
-
-
34247647398
-
MSOL partitioning problems on graphs of bounded treewidth and clique-width
-
Rao M. MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theoret. Comput. Sci. 377 (2007) 260-267
-
(2007)
Theoret. Comput. Sci.
, vol.377
, pp. 260-267
-
-
Rao, M.1
-
25
-
-
0001227241
-
Graph minors. X. Obstructions to tree-decomposition
-
Robertson N., and Seymour P. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52 2 (1991) 153-190
-
(1991)
J. Combin. Theory Ser. B
, vol.52
, Issue.2
, pp. 153-190
-
-
Robertson, N.1
Seymour, P.2
|