Parameterized complexity of connected even/odd subgraph problems (Q395000): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6251116 / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized complexity
Property / zbMATH Keywords: parameterized complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
Euler graph
Property / zbMATH Keywords: Euler graph / rank
 
Normal rank
Property / zbMATH Keywords
 
even graph
Property / zbMATH Keywords: even graph / rank
 
Normal rank
Property / zbMATH Keywords
 
odd graph
Property / zbMATH Keywords: odd graph / rank
 
Normal rank
Property / zbMATH Keywords
 
treewidth
Property / zbMATH Keywords: treewidth / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154257407 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60488404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Subgraphs via Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of even/odd subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Eulerian Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 1 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:36, 7 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of connected even/odd subgraph problems
scientific article

    Statements

    Parameterized complexity of connected even/odd subgraph problems (English)
    0 references
    0 references
    0 references
    28 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized complexity
    0 references
    Euler graph
    0 references
    even graph
    0 references
    odd graph
    0 references
    treewidth
    0 references
    0 references
    0 references