945 search results - page 24 / 189 » Graph Types |
105
Voted
CORR
2004
Springer
15 years 1 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...
122
click to vote
IPL
2011
14 years 8 months ago
2011
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
102
click to vote
JGAA
2007
15 years 1 months ago
2007
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principl...
125
click to vote
PVLDB
2010
15 years 5 days ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
120
Voted
CORR
2007
Springer
15 years 1 months ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...