DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Matching (graph theory)
Matching (graph theory)
Extended Branch Decomposition Graphs: Structural Comparison of Scalar Data
Exploiting C-Closure in Kernelization Algorithms for Graph Problems
3.1 Matchings and Factors: Matchings and Covers
Approximation Algorithms
Multi-Budgeted Matchings and Matroid Intersection Via Dependent Rounding
The Complexity of Multivariate Matching Polynomials
1 Bipartite Matching and Vertex Covers
Exponential Family Bipartite Matching
Map-Matching Using Shortest Paths
Lecture 3: Approximation Algorithms 1 1 Set Cover, Vertex Cover, And
Graph Theory Matchings
Matching Algorithms
NP-Completeness Part One
Matroid Matching: the Power of Local Search
IV-Matching Is Strongly NP-Hard
Lecture 16: NP-Completeness
Dichotomy Theorems for Generalized Chromatic Polynomials
Algorithm Design and Analysis
Top View
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms
Hierarchical B-Matching
I. Matchings and Coverings
Exact Sampling from Perfect Matchings of Dense Nearly Regular Bipartite Graphs
Kernelization of Packing Problems
NP-Completeness (Chapter 8)
Matching. Applications Vertex Cover Cover Is Upper Bound. ∑ Simple Example. Maximum Matching
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
3-Dimensional Matching, Subset Sum Problems
A 2K-Kernelization Algorithm for Vertex Cover Based on Crown
Lecture 1: Basics, Bipartite Matching 1 P, NP, and NP-Complete
Branch Decompositions and Their Applications
Math 776 Graph Theory Lecture Notes 6 Matchings
Matroids [Read Chapter 4 and 7 first.] Status: Needs Significant Revision Or Deletion Merge Into Greedy Notes As Hardsection?
The Maximum Clique Problem: Algorithms, Applications, and Implementations
1. Lecture Notes on Bipartite Matching
Characterizing Graphs of Maximum Matching Width at Most 2
Exact Weight Perfect Matching of Bipartite Graph Is NP-Complete ∗