1729 search results - page 221 / 346 » On Bounds for the k-Partitioning of Graphs |
152
click to vote
GD
2007
Springer
16 years 16 days ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
148
click to vote
SAT
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
175
click to vote
GD
2005
Springer
15 years 12 months ago
2005
Springer
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounde...
181
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
157
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...