91 search results - page 16 / 19 » Pathwidth of outerplanar graphs |
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
ISCAS
2008
IEEE
14 years 1 months ago
2008
IEEE
arallel Graphs (Extended Abstract) Satoshi Tayu, Kumiko Nomura, and Shuichi Ueno Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
WG
2009
Springer
14 years 1 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
GD
2009
Springer
13 years 12 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...