The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs (Q4307048): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: David B. Hartvigsen / rank
Normal rank
 
Property / author
 
Property / author: David B. Hartvigsen / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q29398332 / 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.1137/s0895480190177042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965690159 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:28, 30 July 2024

scientific article; zbMATH DE number 644432
Language Label Description Also known as
English
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
scientific article; zbMATH DE number 644432

    Statements

    The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs (English)
    0 references
    0 references
    0 references
    24 October 1994
    0 references
    all-pairs min cut
    0 references
    minimum cycle basis
    0 references

    Identifiers

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