1933 search results - page 63 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
DAC
2004
ACM
14 years 9 months ago
2004
ACM
The advent of strong multi-level partitioners has made topdown min-cut placers a favored choice for modern placer implementations. We examine terminal propagation, an important st...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
ICITA
2005
IEEE
14 years 2 months ago
2005
IEEE
Small-sample learning in image retrieval is a pertinent and interesting problem. Relevance feedback is an active area of research that seeks to find algorithms that are robust wi...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
TAMC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...