Finding a Minimum Circuit in a Graph (Q4167596): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/siamcomp/ItaiR78, #quickstatements; #temporary_batch_1731530891435
 
(4 intermediate revisions by 4 users not shown)
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.1137/0207033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991858502 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q29041951 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/siamcomp/ItaiR78 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:27, 13 November 2024

scientific article; zbMATH DE number 3601122
Language Label Description Also known as
English
Finding a Minimum Circuit in a Graph
scientific article; zbMATH DE number 3601122

    Statements

    Finding a Minimum Circuit in a Graph (English)
    0 references
    0 references
    0 references
    1978
    0 references

    Identifiers

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