The following pages link to Paths, Trees, and Flowers (Q5341586):
Displaying 50 items.
- Induced graph packing problems (Q604669) (← links)
- König-Egerváry graphs are non-Edmonds (Q605001) (← links)
- Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication (Q623798) (← links)
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- Tree search and quantum computation (Q638594) (← links)
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem (Q641542) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling (Q669802) (← links)
- Approximate triclique coloring for register allocation (Q673230) (← links)
- On paths avoding forbidden pairs of vertices in a graph (Q678872) (← links)
- Bond graphs. II: Causality and singularity (Q678882) (← links)
- Packings and perfect path double covers of maximal planar graphs (Q686163) (← links)
- Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm (Q686268) (← links)
- A generalized hypergreedy algorithm for weighted perfect matching (Q688623) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Strongly linear trend-free block designs and 1-factors of representative graphs (Q698023) (← links)
- Augmenting graphs for independent sets (Q705491) (← links)
- A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors (Q714819) (← links)
- A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 (Q719295) (← links)
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- Simulating the impact of crossover kidney transplantation on the Nord Italia transplant program (Q725048) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- Heuristics for the mixed swapping problem (Q733528) (← links)
- Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352) (← links)
- \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
- Alternating Whitney sums and matchings in trees. II (Q753825) (← links)
- The perfectly matchable subgraph polytope of an arbitrary graph (Q757431) (← links)
- Packing paths perfectly (Q757434) (← links)
- A note on the separation problem for the matching matroid (Q760436) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- Spectral aspects of symmetric matrix signings (Q783041) (← links)
- A characterization of König-Egerváry graphs with extendable vertex covers (Q783699) (← links)
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
- Pairwise kidney exchange (Q813943) (← links)
- Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551) (← links)
- A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem (Q831124) (← links)
- Hierarchical \(b\)-matching (Q831805) (← links)
- Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520) (← links)
- Additive approximation of generalized Turán questions (Q832525) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- A query-efficient quantum algorithm for maximum matching on general graphs (Q832903) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Incremental assignment problem (Q865928) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
