
Efficient Algorithm for Checking 2Chordal (Doubly Chordal) Bipartite Graphs
We present an algorithm for determining whether a bipartite graph G is 2...
read it

Popular Matchings and Limits to Tractability
We consider popular matching problems in both bipartite and nonbipartit...
read it

An Investigation of the Recoverable Robust Assignment Problem
We investigate the socalled recoverable robust assignment problem on ba...
read it

An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences
As a partial answer to a question of Rao, a deterministic and customizab...
read it

Cooperative Games with Bounded Dependency Degree
Cooperative games provide a framework to study cooperation among selfin...
read it

Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application
We provide an elementary proof of a simple, efficient algorithm for comp...
read it

Sequences of radius k for complete bipartite graphs
A kradius sequence for a graph G is a sequence of vertices of G (typica...
read it
On the Complexity of Nucleolus Computation for Bipartite bMatching Games
We explore the complexity of nucleolus computation in bmatching games on bipartite graphs. We show that computing the nucleolus of a simple bmatching game is NPhard even on bipartite graphs of maximum degree 7. We complement this with partial positive results in the special case where b values are bounded by 2. In particular, we describe an efficient algorithm when a constant number of vertices satisfy b(v) = 2 as well as an efficient algorithm for computing the nonsimple bmatching nucleolus when b = 2.
READ FULL TEXT
Comments
There are no comments yet.