540 search results - page 68 / 108 » New bounds on the edge number of a k-map graph |
GD
1998
Springer
14 years 1 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
CIAC
2006
Springer
14 years 19 days ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
ICALP
2000
Springer
14 years 15 days ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
VLDB
2005
ACM
14 years 2 months ago
2005
ACM
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...