275 search results - page 31 / 55 » Bounding the Number of Edges in Permutation Graphs |
166
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
191
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
160
click to vote
FOCS
2009
IEEE
16 years 25 days ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
208
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
178
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...