Name
Abstract | ||
|---|---|---|
. Polynomial-time algorithms for the feedback vertex set problem in cocomparability graphs and convex bipartite graphs are presented. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/s002360050088 | Acta Inf. |
Keywords | Field | DocType |
bipartite graph,feedback vertex set | Complete bipartite graph,Discrete mathematics,Indifference graph,Combinatorics,Chordal graph,Bipartite graph,Cograph,Pathwidth,Mathematics,Feedback vertex set,Maximal independent set | Journal |
Volume | Issue | ISSN |
34 | 5 | 0001-5903 |
Citations | PageRank | References |
19 | 1.20 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Y. Daniel Liang | 1 | 153 | 14.93 |
| Maw-shang Chang | 2 | 550 | 43.47 |