Paths, Trees, and Flowers
From MaRDI portal
Publication:5341586
DOI10.4153/CJM-1965-045-4zbMATH Open0132.20903OpenAlexW4233756358WikidataQ55920169 ScholiaQ55920169MaRDI QIDQ5341586FDOQ5341586
Authors: Jack Edmonds
Publication date: 1965
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1965-045-4
Cited In (only showing first 100 items - show all)
- Optimizing regenerator cost in traffic grooming
- Linear time approximation algorithms for~degree~constrained subgraph problems
- Partial ML estimation for spatial autoregressive nonlinear probit models with autoregressive disturbances
- My experiences as a student and researcher in OR during the 1960's and 70's
- Efficient recognition of equimatchable graphs
- The Legacy of Turing in Numerical Analysis
- Conservative weightings and ear-decompositions of graphs
- Fractional matchings and the Edmonds-Gallai theorem
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
- Interior-point methods: An old and new approach to nonlinear programming
- An improved kernel for max-bisection above tight lower bound
- Lee-Yang theorems and the complexity of computing averages
- Ordered weighted average combinatorial optimization: formulations and their properties
- On average lower independence and domination numbers in graphs
- A theoretical and computational equilibria analysis of a multi-player kidney exchange program
- Struction revisited
- Stabilizing network bargaining games by blocking players
- Finding Gale strings
- Cycles in complementary prisms
- Two easy duality theorems for product partial orders
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- Minimum spectral radius of a weighted graph
- A greedy heuristic for a minimum-weight forest problem
- Bi-criteria and approximation algorithms for restricted matchings
- Limit theory of combinatorial optimization for random geometric graphs
- A good algorithm for lexicographically optimal flows in multi-terminal networks
- Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm
- Dominating induced matchings in graphs without a skew star
- Acyclic orientations of a graph and the chromatic and independence numbers
- A remark on the time complexity of the subtree problem
- A simple reduction from maximum weight matching to maximum cardinality matching
- On matching cover of graphs
- Lineare Charakterisierungen von Travelling Salesman Problemen
- Satisfactory graph partition, variants, and generalizations
- The even-path problem for graphs and digraphs
- A polyhedral study of the maximum edge subgraph problem
- Polynomial-time perfect matchings in dense hypergraphs
- An augmenting path algorithm for linear matroid parity
- Extremal graphs for a new upper bound on domination parameters in graphs
- Exploring the tractability border in epistemic tasks
- Parameterized algorithms for the independent set problem in some hereditary graph classes
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Binary group and Chinese postman polyhedra
- A superlocal version of Reed's conjecture
- Small maximal matchings in random graphs.
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Random assignment under weak preferences
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- Counting the number of perfect matchings in \(K_{5}\)-free graphs
- Two complexity results for the vertex coloring problem
- Combinatorial optimization with 2-joins
- Some properties of minimal arbitrarily partitionable graphs
- Reductions to 1–matching polyhedra
- On the structure of factorizable graphs
- Augmenting graphs for independent sets
- Direct evaluation of pure graph state entanglement
- Improved approximation algorithms for minimum power covering problems
- Nash equilibria in the two-player kidney exchange game
- Greedy matching: guarantees and limitations
- Computational complexity of the perfect matching problem in hypergraphs with subcritical density
- Decision problem for perfect matchings in dense \(k\)-uniform hypergraphs
- Maximum matchings in planar graphs via Gaussian elimination
- Exact algorithms for edge domination
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Packing non-returning \(A\)-paths algorithmically
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs
- Testing for Equality between Maximum Matching and Minimum Node Covering
- Anisotropic mesh generation and adaptation for quads using the \(L_p\)-CVT method
- On the \(k\)-systems of a simple polytope
- On the complexity of solving feasible systems of linear inequalities specified with approximate data
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
- On the linear \(k\)-arboricity of cubic graphs
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- A characterization of König-Egerváry graphs using a common property of all maximum matchings
- Efficient stabilization of cooperative matching games
- Graph editing problems with extended regularity constraints
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- Factors and factorizations of graphs—a survey
- Fast algorithms for the undirected negative cost cycle detection problem
- Induced matchings in graphs of bounded maximum degree
- The time complexity of the token swapping problem and its parallel variants
- FPT algorithms for path-transversal and cycle-transversal problems
- Ear-decompositions of matching-covered graphs
- Per-spectral characterizations of graphs with extremal per-nullity
- Tractability in constraint satisfaction problems: a survey
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- Finite-model theory -- A personal perspective
- Simultaneous matchings: Hardness and approximation
- A geometric theory for hypergraph matching
- Paths, Stars and the Number Three
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Augmenting approach for some maximum set problems
- Traveling salesman problems in temporal graphs
- Topological quantum memory
- Reflections on graph theory
- On vertex independence number of uniform hypergraphs
- Blockers and transversals
- Reconstructing polygons from scanner data
- A degree sequence Hajnal-Szemerédi theorem
This page was built for publication: Paths, Trees, and Flowers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5341586)