99 search results - page 12 / 20 » Directed Feedback Vertex Set Problem is FPT |
SDM
2008
SIAM
13 years 8 months ago
2008
SIAM
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
ISCAS
2003
IEEE
14 years 19 days ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
WABI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
WAOA
2005
Springer
14 years 25 days ago
2005
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...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Online reputation mechanisms need honest feedback to function effectively. Self interested agents report the truth only when explicit rewards offset the cost of reporting and th...