The following pages link to TWO THEOREMS IN GRAPH THEORY (Q3258697):
Displaying 50 items.
- Augmenting approach for some maximum set problems (Q284765) (← links)
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- On the ratio between maximum weight perfect matchings and maximum weight matchings in grids (Q290099) (← links)
- A polynomial time solvable instance of the feasible minimum cover problem (Q293433) (← links)
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- Dynamic matchings in left vertex weighted convex bipartite graphs (Q328682) (← links)
- On matching cover of graphs (Q463743) (← links)
- Implicit computation of maximum bipartite matchings by sublinear functional operations (Q477185) (← links)
- Dulmage-Mendelsohn canonical decomposition as a generic pruning technique (Q487628) (← links)
- Nash equilibria in the two-player kidney exchange game (Q507331) (← links)
- Composability and controllability of structural linear time-invariant systems: distributed verification (Q518300) (← links)
- Perfect matchings as IID factors on non-amenable groups (Q648969) (← links)
- The extremal values of some topological indices in bipartite graphs with a given matching number (Q671135) (← links)
- On paths avoding forbidden pairs of vertices in a graph (Q678872) (← links)
- Augmenting graphs for independent sets (Q705491) (← links)
- Cardinality of relations with applications (Q738869) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- Combinatorial characterizations of the saturation and the associated primes of the fourth power of edge ideals (Q746809) (← links)
- \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
- A characterization of König-Egerváry graphs with extendable vertex covers (Q783699) (← links)
- Hierarchical \(b\)-matching (Q831805) (← links)
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs (Q845858) (← links)
- Structural identifiability in low-rank matrix factorization (Q848955) (← links)
- Bottleneck partial-matching Voronoi diagrams and applications (Q902422) (← links)
- Variations on a theorem of Petersen (Q909672) (← links)
- An efficient distributed algorithm for maximum matching in general graphs (Q911306) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- On finding augmenting graphs (Q955317) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- Finding augmenting chains in extensions of claw-free graphs (Q1007635) (← links)
- Stabilizing maximum matching in bipartite networks (Q1014349) (← links)
- M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles (Q1025964) (← links)
- Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (Q1028148) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- An extension of matching theory (Q1057288) (← links)
- Nonconvergence, undecidability, and intractability in asymptotic problems (Q1095135) (← links)
- The general maximum matching algorithm of Micali and Vazirani (Q1105385) (← links)
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective (Q1133463) (← links)
- On maximal independent sets of vertices in claw-free graphs (Q1139605) (← links)
- On generalized matching problems (Q1149783) (← links)
- Maximum \((g,f)\)-factors of a general graph (Q1179272) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- Julius Petersen's theory of regular graphs (Q1198642) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Finding a maximum matching in a circular-arc graph (Q1209984) (← links)
- Matchings in graphs. II (Q1214950) (← links)
- Covers, matchings and odd cycles of a graph (Q1219306) (← links)
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs (Q1234553) (← links)
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm (Q1323480) (← links)
- Finding maximum matching for bipartite graphs in parallel (Q1342094) (← links)
