Online Matching in Regular Bipartite Graphs With Randomized Adversary

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-98355-4_17
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Online Coloring of Bipartite Graphs With and Without Advice

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2013English

Leaves in Representation Diagrams of Bipartite Distance-Regular Graphs

Journal of Algebraic Combinatorics
CombinatoricsDiscrete MathematicsNumber TheoryAlgebra
2003English

Domination in Bipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Colourings in Bipartite Graphs

International Journal of Computer Applications
2011English

P_m-Saturated Bipartite Graphs With Minimum Size

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

Infinite Homogeneous Bipartite Graphs With Unequal Sides

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1996English

Associative-Commutative Matching via Bipartite Graph Matching

Computer Journal
Computer Science
1995English

Terminal-Pairability in Complete Bipartite Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

An A-Invariant Subspace for Bipartite Distance-Regular Graphs With Exactly Two Irreducible T-Modules With Endpoint 2, Both Thin

Journal of Algebraic Combinatorics
CombinatoricsDiscrete MathematicsNumber TheoryAlgebra
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy