The complexity of restricted spanning tree problems
From MaRDI portal
Cited in
(85)- Exact arborescences, matchings and cycles
- Matching is as easy as matrix inversion
- Optimizing over a slice of the bipartite matching polytope
- The complexity of matching with bonds
- Matching theory -- a sampler: From Dénes König to the present
- Fast geometric approximation techniques and geometric embedding problems
- Corrigendum to ``The complexity of cubical graphs
- Heuristic and exact algorithms for the spanning tree detection problem
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
- Isomorphic tree spanner problems
- Hitting subgraphs in \(P_4\)-tidy graphs
- An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
- The complexity of dissociation set problems in graphs
- Partitioning a graph into small pieces with applications to path transversal
- The k-separator problem: polyhedra, complexity and approximation results
- Knapsack problem with objective value gaps
- Decision-making based on approximate and smoothed Pareto curves
- Spanning trees with minimum weighted degrees
- Integrality gaps for colorful matchings
- Almost exact matchings
- Bi-criteria and approximation algorithms for restricted matchings
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
- Group control for consent rules with consecutive qualifications
- The exact weighted independent set problem in perfect graphs and related classes
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- Deterministic algorithms for multi-criteria TSP
- Solving linear equations parameterized by Hamming weight
- Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- Cooperation in Multiorganization Matching
- Graphical-structure-based models for routing problems
- Balanced spanning forests and trees
- On the difficulty of finding walks of length k
- Simple paths with exact and forbidden lengths
- Uniformly dissociated graphs
- Generalized center problems with outliers
- Generalized center problems with outliers
- General d-position sets
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- A weighted perfect matching with constraints on weights of its parts
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- scientific article; zbMATH DE number 2230227 (Why is no real title available?)
- A \(5k\)-vertex kernel for 3-path vertex cover
- The maximum number of maximum dissociation sets in trees
- On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number
- Extremal vertex-degree function index with given order and dissociation number
- On spectral extrema of graphs with given order and dissociation number
- Filling crosswords is very hard
- Parameterized Complexity of Broadcasting in Graphs
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- Complexity of conformant election manipulation
- Minimizing the number of late jobs on a single machine under due date uncertainty
- On the A_-index of graphs with given order and dissociation number
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- Color-constrained arborescences in edge-colored digraphs
- Stable matching with approval preferences under partial information
- Problems on group-labeled matroid bases
- Solution discovery via reconfiguration for problems in P
- Space-efficient algorithm for integer programming with few constraints
- Totally -modular IPs with two non-zeros in most rows
- Partitioned matching games for international kidney exchange
- The algorithmic complexity of the paired matching problem
- On the exact matching problem in dense graphs
- Arborescences and shortest path trees when colors matter
- Dissociation in circulant graphs and integer distance graphs
- Fairness in graph-theoretical optimization problems
- Exact matching: correct parity and FPT parameterized by independence number
- Broadcast graph is NP-complete
- \textsc{Telephone Broadcast} on graphs of treewidth two
- Analyzing the 3-path vertex cover problem in selected graph classes
- Killing a vortex
- The iteration time and the general position number in graph convexities
- On the congruency-constrained matroid base
- Deterministic algorithms for multi-criteria max-TSP
- Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded
- Broadcasting under structural restrictions
- On finding -th smallest perfect matchings
- Online makespan scheduling under scenarios
- Perfect hierarchical matchings in graphs
- A faster FPT algorithm for 3-path vertex cover
- Nonlinear bipartite matching
- On complexity of special maximum matchings constructing
This page was built for publication: The complexity of restricted spanning tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936213)
