Sciweavers

74 search results - page 3 / 15
» On edge orienting methods for graph coloring
Sort
View
IWOCA
2009
Springer
157views Algorithms» more  IWOCA 2009»
14 years 5 days ago
Forbidden Subgraph Colorings and the Oriented Chromatic Number
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
N. R. Aravind, C. R. Subramanian
CCCG
2010
13 years 7 months ago
Regular labelings and geometric structures
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
David Eppstein
CGF
2010
112views more  CGF 2010»
13 years 5 months ago
Winding Roads: Routing edges into bundles
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
A. Lambert, Romain Bourqui, David Auber
COLING
2010
13 years 18 days ago
Sentiment Translation through Multi-Edge Graphs
Sentiment analysis systems can benefit from the translation of sentiment information. We present a novel, graph-based approach using SimRank, a well-established graph-theoretic al...
Christian Scheible, Florian Laws, Lukas Michelbach...
MVA
2007
127views Computer Vision» more  MVA 2007»
13 years 7 months ago
Vehicle Orientation Detection Using Vehicle Color and Normalized Cut Clustering
This paper proposes a novel approach for vehicle orientation detection using “vehicle color” and edge information based on clustering framework. To extract the “vehicle colo...
Jui-Chen Wu, Jun-Wei Hsieh, Yung-Sheng Chen, Cheng...