3105 search results - page 135 / 621 » The Path-Packing Structure of Graphs |
107
click to vote
JGAA
2007
15 years 3 months ago
2007
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
112
Voted
IJCNN
2008
IEEE
15 years 9 months ago
2008
IEEE
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
100
click to vote
DM
2010
15 years 3 months ago
2010
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
111
Voted
IPL
2008
15 years 3 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
127
click to vote
DM
2007
15 years 3 months ago
2007
—We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality...