scientific article; zbMATH DE number 53892
From MaRDI portal
Publication:4004084
matroid theoryWhitney's theoremVizing's and Brooks's theoremsTutte's 1-factor theoremspanning 2-treespre-flow push algorithmplanaritynumberingminors\(k\)-treesmatchingsgreedy algorithmgreedoidsflows in networkcoverage of digraphschromatic boundsChinese postman problem5-colour theorem
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05Cxx) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Programming involving graphs or networks (90C35)
Recommendations
Cited in
(61)- HyPAM: A hybrid continuum-particle model for incompressible free-surface flows
- Stochastic perturbation analysis of groundwater flow. Spatially variable soils, semi-infinite domains and large fluctuations
- On finding a cycle basis with a shortest maximal cycle
- On the complexity of the robust spanning tree problem with interval data
- Chromatic polynomials and order ideals of monomials
- Parameter depending state space descriptions of index-2-matrix polynomials
- A graph approach for the construction of high order divergence-free Raviart-Thomas finite elements
- Semi-factorial nodal curves and Néron models of Jacobians
- Finding the K shortest hyperpaths
- Spanning trees and identifiability of a single-factor model
- Clustering: a neural network approach
- Shortest route computation in distributed systems
- Time-constrained Chinese postman problems
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
- An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses
- Searchability of central nodes in networks
- Preference graph of potential method as a fuzzy graph
- New degrees of freedom for high-order Whitney approximations of Darcy's flows
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
- Generative program analysis and beyond: the power of domain-specific languages (invited paper)
- On variability and interdependence of local porosity and local tortuosity in porous materials: a case study for sack paper
- Edge importance in a network via line graphs and the matrix exponential
- The fastest itinerary in time-dependent decentralized travel information systems
- Edge agreement of second-order multi-agent system with dynamic quantization via the directed edge Laplacian
- Mining important nodes in directed weighted complex networks
- Hypernetworks in a directed hypergraph
- On plane bipartite graphs without fixed edges
- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- On the generation of curvilinear meshes through subdivision of isoparametric elements
- Foundations of network theory
- scientific article; zbMATH DE number 434909 (Why is no real title available?)
- Topological index analysis applied to coupled flow networks
- Landmarks in Algorithmic Graph Theory: A Personal Retrospective
- scientific article; zbMATH DE number 3910116 (Why is no real title available?)
- scientific article; zbMATH DE number 46091 (Why is no real title available?)
- Design Verification for Bent Sheet Metal Parts: A Graphs Approach
- scientific article; zbMATH DE number 1764950 (Why is no real title available?)
- The Hosoya polynomial of double weighted graphs
- scientific article; zbMATH DE number 814098 (Why is no real title available?)
- scientific article; zbMATH DE number 914491 (Why is no real title available?)
- Graph algorithms
- High Order Whitney Forms on Simplices and the Question of Potentials
- Linear genetic programming control for strongly nonlinear dynamics with frequency crosstalk
- Noise-robust modes of the retinal population code have the geometry of ``ridges and correspond to neuronal communities
- Bin packing with directed stackability conflicts
- scientific article; zbMATH DE number 5785643 (Why is no real title available?)
- A Graph-Based Algorithm for the Approximation of the Spectrum of the Curl Operator
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring
- The determinant of an antiadjacency matrix of a directed cycle graph with chords
- Quantiles dependence and dynamic connectedness between distributed ledger technology and sectoral stocks: enhancing the supply chain and investment decisions with digital platforms
- Basis for high order divergence-free finite element spaces
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times
- Matchings, covers, and Jacobian matrices
- The enumeration of Coxeter elements
- Relative-interior solution for the (incomplete) linear assignment problem with applications to the quadratic assignment problem
- Combinatorics of Castelnuovo-Mumford regularity of binomial edge ideals
- Competing types in preferential attachment graphs with community structure
- A decision support system for vine growers based on a Bayesian network
- Centrality measures for node-weighted networks via line graphs and the matrix exponential
- Graphs, networks and algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4004084)
