close
Jump to content

Undirected (1+ <i>πœ€</i> )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms (Q130851312)

From Wikidata
scientific article published on 10 June 2022
edit
Language Label Description Also known as
default for all languages
No label defined
    English
    Undirected (1+ <i>πœ€</i> )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms
    scientific article published on 10 June 2022

      Statements

      Undirected (1+ <i>πœ€</i> )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms (English)

      Identifiers

       
      edit
        edit
          edit
            edit
              edit
                edit
                  edit
                    edit
                      edit