This commit is contained in:
23
ref.bib
23
ref.bib
@@ -32,17 +32,20 @@
|
||||
pages = {1334--1353},
|
||||
}
|
||||
|
||||
@article{Thorup2008,
|
||||
@inproceedings{Thorup_2008,
|
||||
address = {Victoria British Columbia Canada},
|
||||
title = {Minimum k-way cuts via deterministic greedy tree packing},
|
||||
issn = {07378017},
|
||||
url = {http://dl.acm.org/citation.cfm?id=1374402},
|
||||
doi = {10.1145/1374376.1374402},
|
||||
journal = {Proceedings of the 40th annual ACM symposium on …},
|
||||
ISBN = {9781605580470},
|
||||
url = {https://dl.acm.org/doi/10.1145/1374376.1374402},
|
||||
DOI = {10.1145/1374376.1374402},
|
||||
booktitle = {Proceedings of the fortieth annual ACM symposium on Theory of
|
||||
computing},
|
||||
publisher = {ACM},
|
||||
author = {Thorup, Mikkel},
|
||||
year = {2008},
|
||||
note = {ISBN: 9781605580470},
|
||||
keywords = {k-way cuts, tree packing},
|
||||
pages = {159--165},
|
||||
month = may,
|
||||
pages = {159–166},
|
||||
language = {en},
|
||||
}
|
||||
|
||||
@article{thorup_fully-dynamic_2007,
|
||||
@@ -59,5 +62,7 @@
|
||||
month = feb,
|
||||
year = {2007},
|
||||
pages = {91--127},
|
||||
file = {Thorup_2007_Fully-Dynamic Min-Cut.pdf:/Users/congyu/Zotero/storage/Q329VHH3/Thorup_2007_Fully-Dynamic Min-Cut.pdf:application/pdf},
|
||||
file = {Thorup_2007_Fully-Dynamic
|
||||
Min-Cut.pdf:/Users/congyu/Zotero/storage/Q329VHH3/Thorup_2007_Fully-Dynamic
|
||||
Min-Cut.pdf:application/pdf},
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user