489 search results - page 45 / 98 » Support tools for graphs in computer science |
103
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
129
click to vote
CCE
2005
15 years 1 months ago
2005
In practical system identification, process optimization and controller design, it is often desirable to simultaneously handle several objectives and constraints. In some cases, t...
154
click to vote
FOCS
2009
IEEE
15 years 8 months 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...
106
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
117
click to vote
JGAA
2000
15 years 1 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...