Pages that link to "Item:Q952636"
From MaRDI portal
The following pages link to On complexity of special maximum matchings constructing (Q952636):
Displaying 17 items.
- The minimum maximal k-partial-matching problem (Q395867) (← links)
- On the NP-completeness of the perfect matching free subgraph problem (Q418003) (← links)
- On upper bounds for parameters related to the construction of special maximum matchings (Q658043) (← links)
- Characterization of a class of graphs related to pairs of disjoint matchings (Q1011703) (← links)
- Blockers and transversals (Q1043948) (← links)
- The complexity of matching with bonds (Q1123620) (← links)
- Maximum bounded \(H\)-matching is Max SNP-complete (Q1321820) (← links)
- On the sets of perfect matchings for two bipartite graphs (Q1606933) (← links)
- DNA computing of bipartite graphs for maximum matching (Q1850917) (← links)
- Partitioning to three matchings of given size is NP-complete for bipartite graphs (Q2254544) (← links)
- Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut (Q2299979) (← links)
- Complexity of a disjoint matching problem on bipartite graphs (Q2629777) (← links)
- Computational complexity of existence problems for matchings in graphs. (Q2756482) (← links)
- (Q3976656) (← links)
- Symmetric interdiction for matching problems (Q5002612) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
- Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation (Q5219668) (← links)