Sciweavers

1883 search results - page 57 / 377
» Ordered theta graphs
Sort
View
ARSCOM
2004
86views more  ARSCOM 2004»
13 years 7 months ago
New Conditions for k-ordered Hamiltonian Graphs
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...
Guantao Chen, Ronald J. Gould, Florian Pfender
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 7 months ago
De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
Abbas Alhakim, Mufutau Akinwande
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
14 years 1 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
ICPP
1995
IEEE
13 years 11 months ago
Multilevel Graph Partitioning Schemes
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
George Karypis, Vipin Kumar
APVIS
2004
13 years 9 months ago
Graph Interaction through Force-Based Skeletal Animation
Skeletal animation is a concept that has been used in the areas of motion pictures and computer games to create realistic motion for the animation of articulated characters. Recen...
Colin Murray, Damian Merrick, Masahiro Takatsuka