1395 search results - page 67 / 279 » (k, )-Distance-Hereditary Graphs |
161
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
JGT
2006
14 years 9 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
73
Voted
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
