scientific article

From MaRDI portal

Revision as of 03:15, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4038697

Jump to:navigation, search

zbMath0765.68053MaRDI QIDQ4038697

Danny Krizanc, Jacob Van Den Berg, Evangelos Kranakis

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

distributed computing distributed networks of processors bit- complexity distance regular unlabeled networks unlabeled networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (3)

Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths ⋮ Computing functions on asynchronous anonymous networks ⋮ Symmetries and sense of direction in labeled graphs

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4038697&oldid=17762873"