99 search results - page 13 / 20 » Directed Feedback Vertex Set Problem is FPT |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
One current direction to enhance the search accuracy in visual object retrieval is to reformulate the original query through (pseudo-)relevance feedback, which augments a query wi...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
SI3D
2003
ACM
14 years 18 days ago
2003
ACM
We present a tool for the user-controlled creation of multiresolution meshes. Several automatic mesh reduction methods of high quality have been presented in the past, but most of...
FCT
1993
Springer
13 years 11 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
JCO
2010
13 years 5 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...