15 search results - page 1 / 3 » Polynomial-Time Algorithm for the Leafage of Chordal Graphs |
ESA
2009
Springer
13 years 8 months ago
2009
Springer
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
WALCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
IWOCA
2010
Springer
12 years 11 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
AAIM
2007
Springer
13 years 11 months ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...