Finding pseudoperipheral nodes in graphs (Q797999): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q58329999 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: symrcm / 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/0022-0000(84)90012-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013076693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing extremal and approximate distances in graphs having unit cost edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of a Pseudoperipheral Node Finder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:53, 14 June 2024

scientific article
Language Label Description Also known as
English
Finding pseudoperipheral nodes in graphs
scientific article

    Statements

    Finding pseudoperipheral nodes in graphs (English)
    0 references
    0 references
    1984
    0 references
    sparse graph
    0 references
    SPARSPAK
    0 references
    pseudoperipheral nodes
    0 references
    worst case time complexity
    0 references

    Identifiers

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