4865 search results - page 225 / 973 » The Complexity of Graph Connectivity |
187
click to vote
GD
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
232
click to vote
ICDCS
2002
IEEE
16 years 1 days ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
198
click to vote
GD
1999
Springer
15 years 11 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
226
click to vote
LANMR
2004
15 years 8 months ago
2004
In previous work we have discussed the importance of identifying the cycles that occur in a logic program under the answer set semantics, and the connections between cycles, that w...
165
click to vote
STACS
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. A solid object in 3-dimensional space may be described by a collection of all its topologically distinct 2-dimensional appearances, its aspect graph. In this paper, we st...