Sciweavers

720 search results - page 71 / 144
» Nonrepetitive colorings of graphs
Sort
View
RSA
2011
89views more  RSA 2011»
13 years 2 months ago
Excluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
József Balogh, Jane Butterfield
CVPR
2009
IEEE
15 years 2 months ago
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes), motivated by detecting objects in cluttered background and lear...
Kun Zeng, Liang Lin, Song Chun Zhu, Xiaobai Liu
GD
2008
Springer
13 years 8 months ago
Graph Simultaneous Embedding Tool, GraphSET
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
ICMCS
2008
IEEE
165views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Graph cuts by using local texture features of wavelet coefficient for image segmentation
This paper proposes an approach to image segmentation using Iterated Graph Cuts based on local texture features of wavelet coefficient. Using Multiresolution Analysis based on Ha...
Keita Fukuda, Tetsuya Takiguchi, Yasuo Ariki
WG
2007
Springer
14 years 1 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...