Sciweavers

65 search results - page 1 / 13
» Finding maximum degrees in hidden bipartite graphs
Sort
View
SIGMOD
2010
ACM
172views Database» more  SIGMOD 2010»
13 years 8 months ago
Finding maximum degrees in hidden bipartite graphs
Yufei Tao, Cheng Sheng, Jianzhong Li
DM
2010
143views more  DM 2010»
13 years 3 months ago
Acyclic improper colourings of graphs with bounded maximum degree
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
Louigi Addario-Berry, Louis Esperet, Ross J. Kang,...
COCOON
2010
Springer
13 years 8 months ago
Finding Maximum Edge Bicliques in Convex Bipartite Graphs
Doron Nussbaum, Shuye Pu, Jörg-Rüdiger S...
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
13 years 5 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
ORL
2007
82views more  ORL 2007»
13 years 3 months ago
The path partition problem and related problems in bipartite graphs
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
Jérôme Monnot, Sophie Toulouse