570 search results - page 30 / 114 » Edge Coloring with Delays |
118
click to vote
IV
2010
IEEE
14 years 10 months ago
2010
IEEE
Visualization of graphs containing many nodes and edges efficiently is quite challenging since representations generally suffer from visual clutter induced by the large amount of...
103
click to vote
ALGORITHMICA
2006
14 years 12 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
118
click to vote
TVCG
2008
14 years 11 months ago
2008
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
102
Voted
CHI
2009
ACM
16 years 12 days ago
2009
ACM
Graphs are often visualized using node-link representations: vertices are depicted as dots, edges are depicted as (poly)lines connecting two vertices. A directed edge running from...
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Flash/noflash pairs have been used for noise-reduction in ambient-light images. But not explicitly studied is the problem of shadows in the ambient images. While shadows are less...