2503 search results - page 324 / 501 » A study of 3-arc graphs |
166
click to vote
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
162
click to vote
APAL
2008
15 years 6 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we study imprecise terrains, that is, triangulated terrains with a vertical error interval in the vertices. We study the problem of removing as many local extrema (...
150
click to vote
DAM
2006
15 years 5 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
233
click to vote
IPL
2006
15 years 5 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...