85 search results - page 13 / 17 » Graphs of Bounded Treewidth can be Canonized in AC1 |
182
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
166
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
142
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
191
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
153
click to vote
CATS
2008
15 years 8 months ago
2008
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...