99 search results - page 11 / 20 » Directed Feedback Vertex Set Problem is FPT |
DAM
2008
13 years 7 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
DAM
2008
13 years 7 months ago
2008
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
AUTOMATICA
2004
13 years 7 months ago
2004
Repetitive processes are a distinct class of 2D systems (i.e. information propagation in two independent directions) of both systems theoretic and applications interest. They cann...
APVIS
2001
13 years 8 months ago
2001
This paper demonstrates the application of graph drawing and information visualisation techniques to the visualisation of information which can be modelled as an attributed graph....