1729 search results - page 71 / 346 » Bound Graph Polysemy |
156
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
129
click to vote
SIAMDM
2008
15 years 4 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
146
Voted
ENDM
2008
15 years 5 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
133
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
171
click to vote
DIALM
2008
ACM
15 years 6 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...