Sciweavers

9532 search results - page 362 / 1907
» Logic, Graphs, and Algorithms
Sort
View
APVIS
2004
15 years 8 months ago
Skeletal Animation for the Exploration of Graphs
The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computer-generated characters for motion pictures and computer ...
Damian Merrick, Tim Dwyer
GD
2008
Springer
15 years 7 months ago
Crossing and Weighted Crossing Number of Near-Planar Graphs
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
Sergio Cabello, Bojan Mohar
179
Voted
ALGORITHMICA
2007
82views more  ALGORITHMICA 2007»
15 years 6 months ago
Rigid Components in Molecular Graphs
In this paper we consider 3-dimensional generic bar-and-joint realizations of squares of graphs. These graphs are also called molecular graphs due to their importance in the study...
Bill Jackson, Tibor Jordán
MICS
2008
72views more  MICS 2008»
15 years 6 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
ALGORITHMICA
2011
15 years 1 months ago
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
Sergio Cabello, Bojan Mohar