Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
From MaRDI portal
Publication:1920227
zbMath0865.68086MaRDI QIDQ1920227
Y. Daniel Liang, Maw-Shang Chang
Publication date: 19 June 1997
Published in: Acta Informatica (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs, On the Complexity of Singly Connected Vertex Deletion, Feedback vertex set in hypercubes, Circular convex bipartite graphs: feedback vertex sets, Feedback vertex sets in mesh-based networks, Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs, New upper bounds on feedback vertex numbers in butterflies, A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs, Decycling bipartite graphs, Almost exact minimum feedback vertex set in meshes and butterflies, Feedback vertex sets on restricted bipartite graphs, Connected feedback vertex set on AT-free graphs, Unnamed Item, Degenerate matchings and edge colorings, Feedback vertex set on AT-free graphs, Linear-time algorithm for the paired-domination problem in convex bipartite graphs, Finding maximum edge bicliques in convex bipartite graphs, Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs, Minimum feedback vertex sets in shuffle-based interconnection networks, Subset feedback vertex set on graphs of bounded independent set size, Feedback vertex sets in star graphs, Unnamed Item, The integrity of a cubic graph, A linear time algorithm for the minimum weighted feedback vertex set on diamonds, On the complexity of singly connected vertex deletion, New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
