Exact counting of Euler tours for generalized series-parallel graphs (Q414430): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2011.03.011 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984327409 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1005.3477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel recognition of series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms on a class of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Enumeration of Eulerian Circuits in the Complete Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating a weighted graph polynomial for graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling of Euler tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs and graph decomposition / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JDA.2011.03.011 / rank
 
Normal rank

Latest revision as of 16:54, 9 December 2024

scientific article
Language Label Description Also known as
English
Exact counting of Euler tours for generalized series-parallel graphs
scientific article

    Statements

    Identifiers

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