Computing a minimum biclique cover is polynomial for bipartite domino-free graphs

Authors:
Jérôme Amilhastre;Philippe Janssen;Marie-Catherine Vilarem
Affiliations:
LIRMM, CNRS/Université Montpellier II, France;LIRMM, CNRS/Université Montpellier II, France;LIRMM, CNRS/Université Montpellier II, France
Venue:
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Year:
1997

Towards bipartite graph data management

CloudDB '10 Proceedings of the second international workshop on Cloud data management
A note on broadcast encryption key management with applications to large scale emergency alert systems

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Jump number of two-directional orthogonal ray graphs

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization

Hi-index	0.00