Approximation algorithms for some graph partitioning problems.
Journal of Graph Algorithms and Applications (2000)
- Volume: 4, Issue: 1-2, page 1-11
- ISSN: 1526-1719
Access Full Article
topHow to cite
topHe, G., Liu, J., and Zhao, C.. "Approximation algorithms for some graph partitioning problems.." Journal of Graph Algorithms and Applications 4.1-2 (2000): 1-11. <http://eudml.org/doc/228573>.
@article{He2000,
author = {He, G., Liu, J., Zhao, C.},
journal = {Journal of Graph Algorithms and Applications},
keywords = {experimental testing; graph partitioning; cliques; approximation algorithms; matching algorithms},
language = {eng},
number = {1-2},
pages = {1-11},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Approximation algorithms for some graph partitioning problems.},
url = {http://eudml.org/doc/228573},
volume = {4},
year = {2000},
}
TY - JOUR
AU - He, G.
AU - Liu, J.
AU - Zhao, C.
TI - Approximation algorithms for some graph partitioning problems.
JO - Journal of Graph Algorithms and Applications
PY - 2000
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 4
IS - 1-2
SP - 1
EP - 11
LA - eng
KW - experimental testing; graph partitioning; cliques; approximation algorithms; matching algorithms
UR - http://eudml.org/doc/228573
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.