New upper bounds on feedback vertex numbers in butterflies (Q2390267): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2004.03.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044585412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the feedback vertex set problem on undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the size of the minimum feedback vertex set in meshes and butterflies. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback vertex sets in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelength Conversion in Optical Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum feedback vertex sets in shuffle-based interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the feedback vertex set problem in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating minimum feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the weighted feedback vertex problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost exact minimum feedback vertex set in meshes and butterflies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets and cyclically reducible 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: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank

Latest revision as of 19:02, 1 July 2024

scientific article
Language Label Description Also known as
English
New upper bounds on feedback vertex numbers in butterflies
scientific article

    Statements

    New upper bounds on feedback vertex numbers in butterflies (English)
    0 references
    0 references
    0 references
    0 references
    21 July 2009
    0 references
    interconnection networks
    0 references
    butterfly
    0 references
    feedback vertex sets
    0 references
    0 references
    0 references

    Identifiers