163 search results - page 3 / 33 » The Weighted Integrity Problem is Polynomial for Interval Gr... |
SIAMCOMP
1998
14 years 11 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
114
click to vote
IWOCA
2010
Springer
14 years 6 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
113
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
103
click to vote
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...