Skip to main content
Conference ProceedingsOPEN ACCESS

Upward planarity testing of embedded mixed graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7034 LNCS 427-432
DOI: 10.1007/978-3-642-25878-7_40
6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A mixed graph has both directed and undirected edges. We study an upward planarity testing problem for embedded mixed graphs and solve it using Integer Linear Programming. Experiments show the efficiency of our technique. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Binucci, C., & Didimo, W. (2012). Upward planarity testing of embedded mixed graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7034 LNCS, pp. 427–432). https://doi.org/10.1007/978-3-642-25878-7_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free