Formal derivation of graph algorithmic programs using partition-and-recur (Q1273073): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating path algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925859 / rank
 
Normal rank

Latest revision as of 16:35, 28 May 2024

scientific article
Language Label Description Also known as
English
Formal derivation of graph algorithmic programs using partition-and-recur
scientific article

    Statements

    Formal derivation of graph algorithmic programs using partition-and-recur (English)
    0 references
    12 April 1999
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers