Search Sciweavers | Sciweavers

301 search results - page 6 / 61

» On Finding Dense Subgraphs

111

click to vote

COCOON
2000
Springer

132views Combinatorics» more COCOON 2000»

Parameterized Complexity of Finding Subgraphs with Hereditary Properties

15 years 4 months ago

Download www.cs.umd.edu

We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...

Subhash Khot, Venkatesh Raman

claim paper

Read More »

111

click to vote

ISAAC
2007
Springer

183views Algorithms» more ISAAC 2007»

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

15 years 5 months ago

Download www.imsc.res.in

The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...

Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...

claim paper

Read More »

click to vote

STOC
2009
ACM

145views Algorithms» more STOC 2009»

Finding, minimizing, and counting weighted subgraphs

16 years 9 days ago

Download www.math.ias.edu

d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...

Virginia Vassilevska, Ryan Williams

claim paper

Read More »

click to vote

COCOON
2005
Springer

88views Combinatorics» more COCOON 2005»

A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees

15 years 5 months ago

Download www.iis.sinica.edu.tw

Wen-Lian Hsu

claim paper

Read More »