3757 search results - page 122 / 752 » The overlap number of a graph |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number...
PKDD
2010
Springer
14 years 8 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
DAM
2007
14 years 10 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
DM
2008
14 years 10 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
CAAN
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...