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