Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{863703,
author = {Hliněný, Petr and Chimani, Markus},
address = {USA, internet},
booktitle = {ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)},
keywords = {crossing number; crossing minimization; surface},
howpublished = {elektronická verze "online"},
language = {eng},
location = {USA, internet},
isbn = {978-0-89871-698-6},
pages = {918-927},
publisher = {SIAM / ACM},
title = {Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface},
url = {http://www.siam.org/proceedings/soda/2010/soda10.php},
year = {2010}
}
TY - JOUR
ID - 863703
AU - Hliněný, Petr - Chimani, Markus
PY - 2010
TI - Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
PB - SIAM / ACM
CY - USA, internet
SN - 9780898716986
KW - crossing number
KW - crossing minimization
KW - surface
UR - http://www.siam.org/proceedings/soda/2010/soda10.php
L2 - http://www.siam.org/proceedings/soda/2010/soda10.php
N2 - The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an $O(n\log n)$ time constant factor approximation algorithm for the crossing number of a graph of bounded maximum degree which is ``densely enough'' embeddable in an arbitrary fixed orientable surface.
ER -
HLINĚNÝ, Petr a Markus CHIMANI. Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. Online. In \textit{ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)}. USA, internet: SIAM / ACM, 2010, s.~918-927. ISBN~978-0-89871-698-6.
|
