3008 search results - page 208 / 602 » Independence in connected graphs |
136
click to vote
IV
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper describes a paradigm for visualising time deflow in a network of objects connected by abstract relationships (a graph) by representing time in the third dimension. We ...
213
click to vote
ISAAC
1992
Springer
15 years 10 months ago
1992
Springer
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...
144
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
153
click to vote
JGT
2008
15 years 6 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
164
click to vote
TVCG
2008
15 years 6 months ago
2008
In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications o...