The following pages link to Paths, Trees, and Flowers (Q5341586):
Displaying 50 items.
- A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- Augmenting approach for some maximum set problems (Q284765) (← links)
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (Q326488) (← links)
- Deterministic versus randomized adaptive test cover (Q329717) (← links)
- Maximum matching in multi-interface networks (Q393046) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Matchings in graphs of odd regularity and girth (Q394288) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Altruistically unbalanced kidney exchange (Q403725) (← links)
- On the recognition of fuzzy circular interval graphs (Q408180) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- On matching cover of graphs (Q463743) (← links)
- Certifying algorithms (Q465678) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- The complexity of the zero-sum 3-flows (Q477676) (← links)
- Exploring the tractability border in epistemic tasks (Q484931) (← links)
- A superlocal version of Reed's conjecture (Q490262) (← links)
- Per-spectral characterizations of graphs with extremal per-nullity (Q491098) (← links)
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Nash equilibria in the two-player kidney exchange game (Q507331) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- Efficient stabilization of cooperative matching games (Q526875) (← links)
- Kidney exchange: an egalitarian mechanism (Q533096) (← links)
- A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
- My experiences as a student and researcher in OR during the 1960's and 70's (Q537599) (← links)
- Reconstructing polygons from scanner data (Q553352) (← links)
- On average lower independence and domination numbers in graphs (Q556830) (← links)
- Two easy duality theorems for product partial orders (Q580378) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- Computational complexity of the semantics of some natural language constructions (Q598312) (← links)
- On the maximum even factor in weakly symmetric graphs (Q598466) (← links)
- A characterization of the graphs in which the transversal number equals the matching number (Q599828) (← links)
- Excessive factorizations of bipartite multigraphs (Q602754) (← links)
