Algorithms for finding minimum fundamental cycle bases in graphs (Q3439123): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2004.03.009 / rank
Normal rank
 
Property / author
 
Property / author: Nelson F. Maculan / rank
Normal rank
 
Property / author
 
Property / author: Nelson F. Maculan / 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.endm.2004.03.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022364578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Generating Fundamental Cycles in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a fundamental set of cycles of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3927277 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2004.03.009 / rank
 
Normal rank

Latest revision as of 07:01, 21 December 2024

scientific article
Language Label Description Also known as
English
Algorithms for finding minimum fundamental cycle bases in graphs
scientific article

    Statements

    Algorithms for finding minimum fundamental cycle bases in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2007
    0 references

    Identifiers