3204 search results - page 267 / 641 » The b-chromatic Number of a Graph |
142
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
121
click to vote
WINE
2005
Springer
15 years 6 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
115
Voted
ECML
2004
Springer
15 years 6 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
116
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
109
click to vote
GG
2008
Springer
15 years 1 months ago
2008
Springer
This event is the second instance of the contest for graph transformation-based tools, which was first held as part of the AGTIVE workshop. The aim is to stimulate tool developmen...