Standard
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. / Wulff-Nilsen, C.
Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on. IEEE Computer Society Press, 2011. s. 37-46.
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
Wulff-Nilsen, C 2011,
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. i
Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on. IEEE Computer Society Press, s. 37-46, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, Palm Springs, California, USA,
22/10/2011.
https://doi.org/10.1109/FOCS.2011.15
APA
Wulff-Nilsen, C. (2011).
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. I
Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on (s. 37-46). IEEE Computer Society Press.
https://doi.org/10.1109/FOCS.2011.15
Vancouver
Wulff-Nilsen C.
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. I Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on. IEEE Computer Society Press. 2011. s. 37-46
https://doi.org/10.1109/FOCS.2011.15
Author
Wulff-Nilsen, C. / Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on. IEEE Computer Society Press, 2011. s. 37-46
Bibtex
@inproceedings{5b5c87ae0fb0498fbb75c5653bd64b92,
title = "Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications",
keywords = "computational complexity, graph theory, polynomials, Ku-minor, approximation algorithm, polynomial time dependency, separator theorems, shallow minor free graphs, time algorithm, Algorithm design and analysis, Approximation algorithms, Approximation methods, Clustering algorithms, Heuristic algorithms, Particle separators, Partitioning algorithms, maximum matching, minor-free graph, separator, shallow minor-free graph, shortest path",
author = "C. Wulff-Nilsen",
year = "2011",
doi = "10.1109/FOCS.2011.15",
language = "English",
isbn = "978-1-4577-1843-4 ",
pages = "37--46",
booktitle = "Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on",
publisher = "IEEE Computer Society Press",
note = "null ; Conference date: 22-10-2011 Through 25-10-2011",
}
RIS
TY - GEN
T1 - Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
AU - Wulff-Nilsen, C.
N1 - Conference code: 52
PY - 2011
Y1 - 2011
KW - computational complexity
KW - graph theory
KW - polynomials
KW - Ku-minor
KW - approximation algorithm
KW - polynomial time dependency
KW - separator theorems
KW - shallow minor free graphs
KW - time algorithm
KW - Algorithm design and analysis
KW - Approximation algorithms
KW - Approximation methods
KW - Clustering algorithms
KW - Heuristic algorithms
KW - Particle separators
KW - Partitioning algorithms
KW - maximum matching
KW - minor-free graph
KW - separator
KW - shallow minor-free graph
KW - shortest path
U2 - 10.1109/FOCS.2011.15
DO - 10.1109/FOCS.2011.15
M3 - Article in proceedings
SN - 978-1-4577-1843-4
SP - 37
EP - 46
BT - Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on
PB - IEEE Computer Society Press
Y2 - 22 October 2011 through 25 October 2011
ER -
