Sciweavers

5889 search results - page 155 / 1178
» Graph Layout Problems
Sort
View
DM
2010
131views more  DM 2010»
15 years 6 months ago
Planar graphs without adjacent cycles of length at most seven are 3-colorable
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...
Oleg V. Borodin, Mickaël Montassier, Andr&eac...
GC
2010
Springer
15 years 5 months ago
Star-Uniform Graphs
A star-factor of a graph is a spanning subgraph each of whose components is a star. A graph
Mikio Kano, Yunjian Wu, Qinglin Yu
MST
2011
207views Hardware» more  MST 2011»
15 years 1 months ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
152
Voted
COMPGEOM
2009
ACM
16 years 1 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
639
Voted
CVPR
2012
IEEE
13 years 8 months ago
A Unified Framework for Event Summarization and Rare Event Detection
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
Junseok Kwon and Kyoung Mu Lee