On finding a cycle basis with a shortest maximal cycle (Q1349748): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950576 / 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: A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycle bases of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615283 / rank
 
Normal rank

Revision as of 11:03, 27 May 2024

scientific article
Language Label Description Also known as
English
On finding a cycle basis with a shortest maximal cycle
scientific article

    Statements

    On finding a cycle basis with a shortest maximal cycle (English)
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    Algorithms
    0 references
    Analysis of algorithms
    0 references
    Combinatorial problems
    0 references
    Coding theory
    0 references