Mohlo by se vám také líbit

Více informací o knize Algorithmic Aspects of Graph Connectivity

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 287 bodů

Anotace knihy

Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Combinatorics & graph theory

• Plný název: Algorithmic Aspects of Graph Connectivity
• Autor: Hiroshi NagamochiToshihide Ibaraki
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 392
• EAN: 9780521878647
• ISBN: 0521878640
• ID: 02048686
• Nakladatelství: Cambridge University Press
• Hmotnost: 680 g
• Rozměry: 234 × 160 × 33 mm
• Datum vydání: 08. September 2008

Oblíbené z jiného soudku

---

---

---