Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Computer Science

SOFSEM 2010: SOFSEM 2010: Theory and Practice of Computer Science pp 588–599Cite as

Unilateral Orientation of Mixed Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5901))

Abstract

A digraph D is unilateral if for every pair x, y of its vertices there exists a directed path from x to y, or a directed path from y to x, or both. A mixed graph M = (V,A,E) with arc-set A and edge-set E accepts a unilateral orientation, if its edges can be oriented so that the resulting digraph is unilateral. In this paper, we present the first linear-time recognition algorithm for unilaterally orientable mixed graphs. Based on this algorithm we derive a polynomial algorithm for testing whether a unilaterally orientable mixed graph has a unique unilateral orientation.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, Heidelberg (2007)

    Google Scholar 

  2. Boesch, F., Tindell, R.: Robbins’s Theorem for Mixed Multigraphs. American Mathematical Monthly 87(9), 716–719 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chartrand, G., Harary, F., Schultz, M., Wall, C.E.: Forced Orientation Numbers of a Graph. Congressus Numerantium 100, 183–191 (1994)

    MATH  MathSciNet  Google Scholar 

  4. Chung, F.R.K., Garey, M.R., Tarjan, R.E.: Strongly Connected Orientations of Mixed Multigraphs. Networks 15(4), 477–484 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  5. Farzad, B., Mahdian, M., Mahmoodian, E.S., Saberi, A., Sadri, B.: Forced Orientation of Graphs. Bulletin of Iranian Mathematical Society 32(1), 79–89 (2006)

    MATH  MathSciNet  Google Scholar 

  6. Harary, F., Norman, R.Z., Cartwright, D.: Structural Models: An Introduction to the Theory of Directed Graphs. Addison-Wesley, Reading (1965)

    MATH  Google Scholar 

  7. Mchedlidze, T., Symvonis, A.: Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 250–261. Springer, Heidelberg (2009)

    Google Scholar 

  8. Pascovici, D.: On the Forced Unilateral Orientation Number of a Graph. Discrete Mathematics 187, 171–183 (1997)

    Article  MathSciNet  Google Scholar 

  9. Robbins, H.E.: A Theorem on Graphs, with an Application to a Problem of Traffic Control. American Mathematical Monthly 46, 218–283 (1939)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, National Technical University of Athens, Athens, Greece

    Tamara Mchedlidze & Antonios Symvonis

Authors
  1. Tamara Mchedlidze
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonios Symvonis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584 CH, Utrecht, The Netherlands

    Jan van Leeuwen

  2. LaBRI, Universit Bordeaux, 351 cours de la Libration, 1F-33405, Talence Cedex, France

    Anca Muscholl

  3. Department of Computer Science & Applied Mathematics, Weizmann Institute, Faculty of Mathematics and Computer Science, 76100, Rehovot, Israel

    David Peleg

  4. Department of Software Engineering Faculty of Mathematics and Physics Malostranské nám, Charles University, 25 11800, Prague 1, Czech Republic

    Jaroslav Pokorný

  5. Software Engineering, Department of Computer Science, RWTH Aachen University, 3, Ahornstrae 55, D-52074, Aachen, Germany

    Bernhard Rumpe

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mchedlidze, T., Symvonis, A. (2010). Unilateral Orientation of Mixed Graphs. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11266-9_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11265-2

  • Online ISBN: 978-3-642-11266-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation