Disjoint cycles intersecting a set of vertices (Q713977): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.jctb.2012.05.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075199819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Feedback Vertex Set Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Packing Disjoint Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Directed Circuits through Prescribed Vertices Bounded Fractionally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles through prescribed vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and hardness results for cycle packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:42, 5 July 2024

scientific article
Language Label Description Also known as
English
Disjoint cycles intersecting a set of vertices
scientific article

    Statements

    Disjoint cycles intersecting a set of vertices (English)
    0 references
    0 references
    19 October 2012
    0 references
    graph
    0 references
    disjoint cycles
    0 references
    \(S\)-cycles
    0 references
    packing
    0 references

    Identifiers