370 search results - page 40 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
109
click to vote
ICCSA
2004
Springer
15 years 7 months ago
2004
Springer
Research involving different forms of networks, such as internet networks, social networks, and cellular networks, has increasingly become an important field of study. From this wo...
128
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
126
click to vote
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
111
click to vote
ICFCA
2005
Springer
15 years 7 months ago
2005
Springer
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...