13 search results - page 2 / 3 » Parameterized Graph Editing with Chosen Vertex Degrees |
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
129
click to vote
ACID
2006
15 years 1 months ago
2006
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
114
Voted
MICS
2010
14 years 10 months ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
WEA
2005
Springer
15 years 5 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...