4913 search results - page 128 / 983 » Results and Perspectives of the G |
MICS
2008
13 years 10 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
SIAMCOMP
2008
13 years 10 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
JCT
2007
13 years 10 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...
JDWM
2007
13 years 10 months ago
2007
The PAKDD Competition 2006 involved the problem of classifying mobile telecom network customers into 2G and 3G, with the ultimate aim of identifying existing 2G network customers w...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...