1101 search results - page 54 / 221 » An Algorithm for the Graph Crossing Number Problem |
109
Voted
STACS
2004
Springer
15 years 8 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
121
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
141
Voted
DAM
2011
14 years 9 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
130
Voted
WDAG
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
109
Voted
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...