On the parameterized complexity of the edge monitoring problem (Q509893): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2017.01.008 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6687383 / rank
 
Normal rank
Property / zbMATH Keywords
 
Edge Monitoring
Property / zbMATH Keywords: Edge Monitoring / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized complexity
Property / zbMATH Keywords: parameterized complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
FPT algorithm
Property / zbMATH Keywords: FPT algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
bidimensionality theory
Property / zbMATH Keywords: bidimensionality theory / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / 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.ipl.2017.01.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2583078788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity of grid minors in treewidth with applications through bidimensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction obstructions for treewidth / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2017.01.008 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:53, 9 December 2024

scientific article
Language Label Description Also known as
English
On the parameterized complexity of the edge monitoring problem
scientific article

    Statements

    On the parameterized complexity of the edge monitoring problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 February 2017
    0 references
    Edge Monitoring
    0 references
    parameterized complexity
    0 references
    FPT algorithm
    0 references
    bidimensionality theory
    0 references
    graph algorithms
    0 references

    Identifiers

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