85 search results - page 5 / 17 » Graphs of Bounded Treewidth can be Canonized in AC1 |
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
MFCS
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
CSL
2009
Springer
15 years 4 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
NIPS
2008
14 years 11 months ago
2008
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...