Author:
De Fraysseix H.,Pach J.,Pollack R.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference23 articles.
1. B.Chazelle, Slimming down search structures: a functional approach to algorithm design, inProceedings of the Twenty Sixth Annual Symposium on the Foundations of Computer Science,1985, 165–174.
2. N.Chiba, T.Yamanouchi and T.Nishizeki, Linear algorithms for convex drawings of planar graphs, inProgress in graph theory,1982, 153–173.
3. P. Duchet, Y. Hamidoune, M. Las Vergnas andH. Meyniel, Representing a planar graph by vertical lines joining different intervals,Discrete Math.,46 (1983), 319–321.
4. I. Fáry, On straight line representing of planar graphs,Acta. Sci. Math. (Szeged),11 (1948), 229–233.
5. H.de Fraysseix,Drawing planar and non-planar graphs from the half-edge code (to appear).
Cited by
412 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献