Revisiting the Isoperimetric Graph Partitioning Problem

Sravan Danda, Aditya Challa, B. S. Daya Sagar, Laurent Najman

Open source

DOI
10.1109/access.2019.2901094
Published
2019
Container
IEEE Access
Publisher
Not recorded
Open access
yes

Credibility signals

uncertain Score 53/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1109/access.2019.2901094,
  title = {Revisiting the Isoperimetric Graph Partitioning Problem},
  author = {Sravan Danda and Aditya Challa and B. S. Daya Sagar and Laurent Najman},
  year = {2019},
  journal = {IEEE Access},
  doi = {10.1109/access.2019.2901094},
  url = {https://doi.org/10.1109/access.2019.2901094}
}

RIS

TY  - JOUR
TI  - Revisiting the Isoperimetric Graph Partitioning Problem
AU  - Sravan Danda
AU  - Aditya Challa
AU  - B. S. Daya Sagar
AU  - Laurent Najman
PY  - 2019
JO  - IEEE Access
DO  - 10.1109/access.2019.2901094
UR  - https://doi.org/10.1109/access.2019.2901094
ER  - 

APA

Danda, S., Challa, A., Sagar, B. S. D., & Najman, L. (2019). Revisiting the Isoperimetric Graph Partitioning Problem. IEEE Access. https://doi.org/10.1109/access.2019.2901094

Source records