4865 search results - page 381 / 973 » The Complexity of Graph Connectivity |
163
click to vote
WSC
1997
15 years 8 months ago
1997
Techniques to visualize quantitative discrete event simulation input and output data are presented. General concepts connected with graphical excellence are discussed in a simulat...
161
Voted
APPML
2006
15 years 6 months ago
2006
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
166
click to vote
DM
2007
15 years 6 months ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
171
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
140
click to vote
JGT
2007
15 years 6 months ago
2007
Let Γ be an infinite, locally finite, connected graph with distance function δ. Given a ray P in Γ and a constant C ≥ 1, a vertex-sequence {xn}∞ n=0 ⊆ V P is said to be...