Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2003.09.003 / rank
Normal rank
 
Property / author
 
Property / author: Jian'er Chen / rank
 
Normal rank
Property / author
 
Property / author: Iyad A. Kanj / rank
 
Normal rank
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.jcss.2003.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037479769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved fixed-parameter algorithm for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large FPT problems on coarse-grained parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of type inference for higher-order typed lambda calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of efficient algorithms for reconfiguration of memory arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method to speed up fixed-parameter-tractable algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of minimal vertex covers for row/column allocation in self-repairable arrays / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2003.09.003 / rank
 
Normal rank

Latest revision as of 11:06, 16 December 2024

scientific article
Language Label Description Also known as
English
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
scientific article

    Statements

    Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (English)
    0 references
    19 August 2004
    0 references
    Vertex cover
    0 references
    Bipartite graph
    0 references
    Graph matching
    0 references
    Parameterized computation
    0 references
    0 references
    0 references

    Identifiers