Join Our Newsletter

AAAI

2012

8 years 5 months ago
2012

In cooperative games, a key question is to ﬁnd a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...

TCS

2010

9 years 9 months ago
2010

In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...

SIAMDM

2010

10 years 1 months ago
2010

Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...

JGT

2010

10 years 1 months ago
2010

We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...

COLOGNETWENTE

2010

10 years 1 months ago
2010

Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...

MOR

2007

10 years 2 months ago
2007

The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the proﬁts of each of the edges is maximized. The set M is...

DM

2002

10 years 2 months ago
2002

A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...

CMOT

2004

10 years 2 months ago
2004

We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...

ALGORITHMICA

2004

10 years 2 months ago
2004

We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...

AMAI

2005

Springer

10 years 2 months ago
2005

Springer

A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...