Sciweavers

3471 search results - page 205 / 695
» Obstacle Numbers of Graphs
Sort
View
115
Voted
CORR
2011
Springer
141views Education» more  CORR 2011»
14 years 12 months ago
Geometric Semigroup Theory
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show h...
Jon McCammond, John Rhodes, Benjamin Steinberg
DAC
2008
ACM
16 years 6 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
15 years 11 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
3DPVT
2006
IEEE
194views Visualization» more  3DPVT 2006»
15 years 11 months ago
Histogram Matching for Camera Pose Neighbor Selection
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....
Kevin L. Steele, Parris K. Egbert, Bryan S. Morse
139
Voted
COCOON
2005
Springer
15 years 10 months ago
On the Complexity of the Balanced Vertex Ordering Problem
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
Jan Kára, Jan Kratochvíl, David R. W...