823 search results - page 31 / 165 » Brick partitions of graphs |
159
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
167
click to vote
CCCG
2010
15 years 7 months ago
2010
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...
149
click to vote
DAM
2006
15 years 6 months ago
2006
We prove that a triangle-free graph G is a tolerance graph if and only if there exists a set of consecutively ordered stars that partition the edges of G. Since tolerance graphs a...
259
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently ...
143
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...