Graphs, networks and algorithms.

DOI10.1007/978-3-642-32278-5zbMath1255.68001OpenAlexW4294576854MaRDI QIDQ455381

Dieter Jungnickel

Publication date: 5 October 2012

Published in: Algorithms and Computation in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32278-5

zbMATH Keywords

combinatoricscomplexitygraph theoryapproximation algorithmsoptimization algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algorithms in computer science (68Wxx) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items

Evolutionary operators for the Hamiltonian completion problem ⋮ Randomized Shortest-Path Problems: Two Related Models ⋮ NP-Completeness in the gossip monoid ⋮ An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in ecology ⋮ Pickup and delivery problems with autonomous vehicles on rings ⋮ Random subcomplexes of finite buildings, and fibering of commutator subgroups of right‐angled Coxeter groups ⋮ Cycle-based formulations in distance geometry ⋮ Review of Similarities between Adjacency Model and Relational Model ⋮ Finding socially best spanning treesî ⋮ Matchmaking and Testing for Exponentiality in the M/G/∞ Queue ⋮ Timeline-based planning over dense temporal domains ⋮ Overlaying a hypergraph with a graph with bounded maximum degree ⋮ Unnamed Item ⋮ Codes for distributed storage from 3-regular graphs ⋮ Heuristics for the dynamic facility location problem with modular capacities ⋮ Roots of Bivariate Polynomial Systems via Determinantal Representations ⋮ Robust Independence Systems ⋮ Unnamed Item ⋮ A first hitting time approach to finding effective spreaders in a network ⋮ Mixing time and eigenvalues of the abelian sandpile Markov chain ⋮ Brownian motions on metric graphs