Chapter 2. Fundamentals

DOI10.1007/978-3-540-31955-9_2MaRDI QIDQ5703977zbMATH OpenOpenAlexFDO

Authors Ulrik Brandes, Thomas Erlebach

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106453

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2202358
• Graphs, networks and algorithms.
• Graphs and algorithms
• Graph theory and applications with exercises and problems
• scientific article; zbMATH DE number 3906496

Cited in

(4)

• Comparison between two different cardiovascular models during a hemorrhagic shock scenario
• Algorithmic networks: central time to trigger expected emergent open-endedness
• Complex graph algorithms
• A faster algorithm to update betweenness centrality after node alteration

This page was built for publication: Chapter 2. Fundamentals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703977)