1027 search results - page 8 / 206 » Ordered Vertex Partitioning |
EOR
2010
13 years 7 months ago
2010
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
COMBINATORICS
2004
13 years 7 months ago
2004
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to ...
ISAAC
2003
Springer
14 years 20 days ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
GD
2004
Springer
14 years 26 days ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...