Assessing the Computational Complexity of Multi-layer Subgraph Detection (Q5283362): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1604.07724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Feedback Vertex Set: A Parameterized Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive graph searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Connectedness of Edge-Bicolored Graphs and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The h-Index of a Graph and its Application to Dynamic Subgraph Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding subgraphs with hereditary properties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of <i>k</i>-B<scp>iclique</scp> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community Structure in Time-Dependent, Multiscale, and Multiplex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors and factorization: 1985--2003: a survey / rank
 
Normal rank

Latest revision as of 03:41, 14 July 2024

scientific article; zbMATH DE number 6751057
Language Label Description Also known as
English
Assessing the Computational Complexity of Multi-layer Subgraph Detection
scientific article; zbMATH DE number 6751057

    Statements

    Assessing the Computational Complexity of Multi-layer Subgraph Detection (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 July 2017
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references