5889 search results - page 402 / 1178 » Graph Layout Problems |
194
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
179
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
178
click to vote
HASE
2008
IEEE
16 years 1 months ago
2008
IEEE
A high assurance system requires both functional and nonfunctional correctness before the system is put into operation. To examine whether a system’s actual performance complies...
163
click to vote
ICTCS
2005
Springer
16 years 10 days ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
162
click to vote
SWAT
2004
Springer
16 years 6 days ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...