Convex bipartite graph: Difference between revisions

Content deleted Content added
Bluelink 1 book for verifiability. [goog]) #IABot (v2.0) (GreenC bot
OAbot (talk | contribs)
m Open access bot: hdl added to citation with #oabot.
Line 14:
 
==References==
*{{cite journal|author=W. Lipski Jr.|author2=[[Franco P. Preparata]] |date=August 1981|title=Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems|journal=Acta Informatica|volume=15|issue=4|pages=329–346|doi=10.1007/BF00264533|hdl=2142/74215|hdl-access=free}}
*{{cite journal|author=Ten-hwang Lai|author2=Shu-shang Wei|date=April 1997|title=Bipartite permutation graphs with application to the minimum buffer size problem|journal=Discrete Applied Mathematics|volume=74|issue=1|pages=33–55|doi=10.1016/S0166-218X(96)00014-5|url=http://citeseer.ist.psu.edu/old/lai94bipartite.html|accessdate=2009-07-20}}
*{{cite book|title=Efficient graph representations|author=Jeremy P. Spinrad|year=2003|publisher=[[American Mathematical Society|AMS]] Bookstore|isbn= 978-0-8218-2815-1 |page=128|url=https://books.google.com/books?id=RrtXSKMAmWgC&pg=PA128&lpg=PA128&dq=%22a+bipartite+graph+is+a+convex+graph%22|accessdate=2009-07-20}}