@techreport { pettie:ackermann,
author = "Seth Pettie",
title = "{Finding minimum spanning trees in $\O(m\timesalpha(m,n))$ time}",
- institution = "Univ. of Texas at Austin",
+ institution = "University of Texas at Austin",
year = "1999",
number = "TR99-23",
type = "Tech Report"
author = "Martin Mare\v{s}",
title = "{Two linear time algorithms for MST on minor closed graph classes}",
journal = "{Archivum Mathematicum}",
- publisher = "Masaryk University",
- address = "Brno, Czech Republic",
+ publisher = "Masaryk University",
+ address = "Brno, Czech Republic",
volume = "40",
pages = "315--320",
year = "2004"
number={1},
pages={48--50},
year={1956},
- publisher={JSTOR}
}
@book{ diestel:gt,
number={1},
pages={57--74},
year={1997},
- publisher={Elsevier}
}
@inproceedings{ katriel:cycle,
number={2},
pages={109--122},
year={1986},
- publisher={Springer Verlag}
}
@online{ eisner:tutorial,
title={{Combinatorial Algorithms: Theory and Practice}},
author={Reingold, E. M.},
year={1977},
- publisher={Prentice Hall College Div}
+ publisher={Prentice Hall College Div.}
}
@inproceedings{ dietz:oal,
@article{ even:dinic,
author = {Shimon Even and Robert Endre Tarjan},
title = {Network Flow and Testing Graph Connectivity},
- publisher = {SIAM},
year = {1975},
journal = {SIAM Journal on Computing},
volume = {4},
number={1-2},
pages={337--344},
year={1999},
- publisher={Elsevier}
}
@article{ thorup:rampq,
year = {2003},
isbn = {0-89871-538-5},
pages = {813--822},
- publisher = {Society for Industrial and Applied Mathematics},
}
@book{ ieee:binfp,
number={1},
pages={118--133},
year={1928},
- publisher={Springer},
+ publisher={Springer Verlag},
notes={In German}
}