275 search results - page 32 / 55 » Bounding the Number of Edges in Permutation Graphs |
170
click to vote
JCO
2011
15 years 1 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
208
click to vote
FOCS
2009
IEEE
16 years 25 days ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
171
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
154
click to vote
ENDM
2007
15 years 6 months ago
2007
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
142
click to vote
WDAG
2007
Springer
16 years 5 days ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...