Wikipedia:Articles for deletion/Bipartite realization algorithm


 * The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review).  No further edits should be made to this page.

The result was   delete. j⚛e deckertalk 02:35, 2 August 2014 (UTC)

Bipartite realization algorithm

 * – ( View AfD View log  Stats )

Probably WP:OR: describes an algorithm "was never been published in a scientific paper", and indeed I haven't been able to find this algorithm in GScholar. Unless someone can come up with a good reference, I suggest we delete this article. (I've already asked the author for a reference, but got no reply.) Q VVERTYVS (hm?) 09:11, 25 July 2014 (UTC)
 * Note: This debate has been included in the list of Science-related deletion discussions. • Gene93k (talk) 16:07, 25 July 2014 (UTC)


 * Delete. Non-notable unpublished WP:OR. -- 101.117.0.208 (talk) 14:38, 26 July 2014 (UTC)
 * Delete. Even if this were published, there are big chunks of missing information here: what is the running time of this method, why would one want to do it this way instead of using the obvious network flow formulation, and more importantly, why is realizing bipartite graphical degree sequences a useful thing to do? But without publications, there is nothing to use as a source for an article here. —David Eppstein (talk) 06:45, 28 July 2014 (UTC)
 * Delete. Only GHits are Wikipedia and mirrors, and the article stating that it hasn't been published makes this an easy decision. --Michig (talk) 10:40, 1 August 2014 (UTC)
 * The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.