Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2400813080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A REVIEW OF TREE CONVEX SETS TEST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Feedback Vertex Set New Measure and New Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3397627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in convex and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum feedback vertex set problem: Exact and enumeration algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Induced Subgraphs via Minimal Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithm for the paired-domination problem in convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Hardness Results on Feedback Vertex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets on restricted bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Feedback Vertex Sets in Restricted Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Domination on Tree Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Sets on Tree Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets in star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments / rank
 
Normal rank

Latest revision as of 04:17, 7 July 2024

scientific article
Language Label Description Also known as
English
Circular Convex Bipartite Graphs: Feedback Vertex Set
scientific article

    Statements

    Circular Convex Bipartite Graphs: Feedback Vertex Set (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 December 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    feedback vertex set
    0 references
    circular convex bipartite graph
    0 references
    convex bipartite graph
    0 references
    Cook reduction
    0 references
    tractability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references