482 search results - page 8 / 97 » A Linear-Time Graph Kernel |
FCT
1993
Springer
15 years 1 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...
PLDI
1994
ACM
15 years 1 months ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract--In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method "label-and-decide." W...
108
click to vote
WADS
2007
Springer
15 years 3 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
ICALP
1997
Springer
15 years 1 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....