71 search results - page 11 / 15 » A fixed-parameter algorithm for the directed feedback vertex... |
133
click to vote
FCT
1993
Springer
15 years 7 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...
137
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
138
click to vote
COCO
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
112
click to vote
JCO
2010
15 years 1 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...
114
Voted
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...