715 search results - page 68 / 143 » On graphs with subgraphs having large independence numbers |
FSTTCS
2009
Springer
15 years 6 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...
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
134
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
STACS
2004
Springer
15 years 5 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
133
click to vote
ICTAI
2009
IEEE
14 years 9 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...