Sciweavers

677 search results - page 2 / 136
» Bipartite roots of graphs
Sort
View
IPL
2010
158views more  IPL 2010»
13 years 2 months ago
Finding bipartite subgraphs efficiently
Polynomial algorithms are given for the following two problems:
Dhruv Mubayi, György Turán
ISAAC
2009
Springer
150views Algorithms» more  ISAAC 2009»
13 years 11 months ago
Random Generation and Enumeration of Bipartite Permutation Graphs
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, R...
JGT
2010
127views more  JGT 2010»
13 years 3 months ago
On the minimum degree of minimal Ramsey graphs
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...
Tibor Szabó, Philipp Zumstein, Stefanie Z&u...
JCO
2000
59views more  JCO 2000»
13 years 5 months ago
Facets of an Assignment Problem with 0-1 Side Constraint
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
Abdo Y. Alfakih, Tongnyoul Yi, Katta G. Murty
COCO
2004
Springer
93views Algorithms» more  COCO 2004»
13 years 10 months ago
Lower Bounds for Testing Bipartiteness in Dense Graphs
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
Andrej Bogdanov, Luca Trevisan