146 search results - page 4 / 30 » A new characterization of P6-free graphs |
COMBINATORICA
2010
13 years 2 months ago
2010
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we charact...
IM
2006
13 years 7 months ago
2006
Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on "local" p...
DAM
1998
13 years 7 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
We propose a novel structure, the data-sharing graph, for characterizing sharing patterns in large-scale data distribution systems. We analyze this structure in two such systems a...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...