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

approximation algorithmscombinatoricscomplexitygraph theoryoptimization algorithms

Mathematics Subject Classification ID

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

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

(35)

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

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)