Graphs, networks and algorithms.

DOI10.1007/978-3-642-32278-5MaRDI QIDQ455381zbMATH OpenOpenAlexFDO

Authors 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

combinatoricsgraph theorycomplexityapproximation algorithmsoptimization algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 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 (05Cxx)

Recommendations

• Graphs, networks and algorithms
• Graphs and networks. Theory and basic algorithms
• Graphs, Algorithms, and Optimization
• Algorithmische Graphentheorie
• Algorithmische Graphentheorie
• Algorithmische Graphentheorie
• scientific article; zbMATH DE number 49984
• Graphs and networks
• Graphs and graph algorithms

Cited in

(31)

• Pickup and delivery problems with autonomous vehicles on rings
• On equitable coloring of extented corona of some graphs
• Robust independence systems
• An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in ecology
• Timeline-based planning over dense temporal domains
• Independent sets and vertex covers considered within the context of robust optimization
• Randomized Shortest-Path Problems: Two Related Models
• Mixing time and eigenvalues of the abelian sandpile Markov chain
• Finding socially best spanning treesî
• Matchmaking and testing for exponentiality in the \(M/G/\infty\) queue
• Roots of bivariate polynomial systems via determinantal representations
• Graphs and algorithms
• Network Analysis
• GRAPHS, NETWORKS AND ACE
• Review of similarities between adjacency model and relational model
• A first hitting time approach to finding effective spreaders in a network
• Heuristics for the dynamic facility location problem with modular capacities
• Solving the minimum-cost double Roman domination problem
• Evolutionary operators for the Hamiltonian completion problem
• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• NP-completeness in the gossip monoid
• Cycle-based formulations in distance geometry
• scientific article; zbMATH DE number 2131528 (Why is no real title available?)
• scientific article; zbMATH DE number 4049649 (Why is no real title available?)
• Overlaying a hypergraph with a graph with bounded maximum degree
• scientific article; zbMATH DE number 482901 (Why is no real title available?)
• Random subcomplexes of finite buildings, and fibering of commutator subgroups of right‐angled Coxeter groups
• Algorithmische Graphentheorie
• Brownian motions on metric graphs
• Algorithmische Graphentheorie
• Codes for distributed storage from 3-regular graphs

This page was built for publication: Graphs, networks and algorithms.

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