Algorithm engineering for optimal graph bipartization.
Journal of Graph Algorithms and Applications (2009)
- Volume: 13, Issue: 2, page 77-98
- ISSN: 1526-1719
Access Full Article
top
How to cite
topHüffner, Falk. "Algorithm engineering for optimal graph bipartization.." Journal of Graph Algorithms and Applications 13.2 (2009): 77-98. <http://eudml.org/doc/45460>.
@article{Hüffner2009,
author = {Hüffner, Falk},
journal = {Journal of Graph Algorithms and Applications},
keywords = {iterative compression method},
language = {eng},
number = {2},
pages = {77-98},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Algorithm engineering for optimal graph bipartization.},
url = {http://eudml.org/doc/45460},
volume = {13},
year = {2009},
}
TY - JOUR
AU - Hüffner, Falk
TI - Algorithm engineering for optimal graph bipartization.
JO - Journal of Graph Algorithms and Applications
PY - 2009
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 13
IS - 2
SP - 77
EP - 98
LA - eng
KW - iterative compression method
UR - http://eudml.org/doc/45460
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.