Sciweavers

836 search results - page 10 / 168
» Orthogonal Colorings of Graphs
Sort
View
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
15 years 6 months ago
ORIGAMI: Mining Representative Orthogonal Graph Patterns
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, J&e...
89
Voted
JGAA
2000
85views more  JGAA 2000»
14 years 11 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
90
Voted
SADM
2008
90views more  SADM 2008»
14 years 11 months ago
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, J&e...
STOC
2007
ACM
110views Algorithms» more  STOC 2007»
15 years 12 months ago
Randomly coloring planar graphs with fewer colors than the maximum degree
Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda
88
Voted
JGT
2010
89views more  JGT 2010»
14 years 10 months ago
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
We study vertex-colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3-connected plane graph with n vert...
Zdenek Dvorak, Daniel Král', Riste Skrekovs...