2125 search results - page 8 / 425 » On Graph Complexity |
GD
2009
Springer
13 years 10 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
ESWS
2005
Springer
14 years 1 months ago
2005
Springer
The Resource Description Framework (RDF) is a metadata model and language recommended by the W3C. This paper presents a framework to incorporate temporal reasoning into RDF, yieldi...
VL
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
WG
2005
Springer
14 years 28 days ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
EOR
2008
13 years 7 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...