3471 search results - page 197 / 695 » Obstacle Numbers of Graphs |
133
Voted
GD
2004
Springer
15 years 10 months ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
127
click to vote
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
153
click to vote
AAIM
2010
Springer
15 years 8 months ago
2010
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
137
Voted
ACL
2006
15 years 6 months ago
2006
An unsupervised part-of-speech (POS) tagging system that relies on graph clustering methods is described. Unlike in current state-of-the-art approaches, the kind and number of dif...
129
click to vote
CIC
2004
15 years 6 months ago
2004
Hexagonal mesh and torus, as well as honeycomb and certain other pruned torus networks, are known to belong to the class of Cayley graphs which are node-symmetric and possess othe...