Sciweavers

491 search results - page 18 / 99
» On cyclically orientable graphs
Sort
View
JCT
2006
79views more  JCT 2006»
13 years 8 months ago
A characterization of cocircuit graphs of uniform oriented matroids
The cocircuit graph of an oriented matroid is the 1-skeleton of the cellular decomposition induced by the Topological Representation Theorem due to Folkman and Lawrence (1978) [J....
Juan José Montellano-Ballesteros, Ricardo S...
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
14 years 5 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
GD
2006
Springer
14 years 2 days ago
Parameterized st -Orientations of Graphs: Algorithms and Experiments
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
Charalampos Papamanthou, Ioannis G. Tollis
WACV
2005
IEEE
14 years 2 months ago
Periodic Motion Detection and Estimation via Space-Time Sampling
A novel technique to detect and localize periodic movements in video is presented. The distinctive feature of the technique is that it requires neither feature tracking nor object...
Ashwin Thangali, Stan Sclaroff
CG
2006
Springer
14 years 5 days ago
A Retrograde Approximation Algorithm for One-Player Can't Stop
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
James Glenn, Haw-ren Fang, Clyde P. Kruskal