Skip to main content
SpringerLink
Log in
Book cover

Latin American Symposium on Theoretical Informatics

LATIN 2000: LATIN 2000: Theoretical Informatics pp 308–317Cite as

On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1776))

Abstract

In this paper we show that the routing permutation problem is NP-hard even for binary trees. Moreover, we show that in the case of unbounded degree tree networks, the routing permutation problem is NP-hard even if the permutations to be routed are involutions. Finally, we show that the average-case complexity of the routing permutation problem on linear networks is n/4 + o(n).

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Aumann, Y., Rabani, Y.: Improved bounds for all optical routing. In: Proc. of the 6th ACM-SIAM SODA, pp. 567–576 (1995)

    Google Scholar 

  2. Biane, P.: Permutations suivant le type d’excédance et le nombre d’inversions et interprétation combinatoire d’une fraction continue de Heine. Eur. J. Comb. 14(4), 277–284 (1993)

    Article  Google Scholar 

  3. Caragiannis, I., Kaklamanis, C., Persiano, P.: Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. In: Proc. of SIROCCO (1998)

    Google Scholar 

  4. Cheung, N.K., Nosu, K., Winzer, G. (eds.): Special Issue on Dense Wavelength Division Multiplexing Techniques for High Capacity and Multiple Access Communications Systems. IEEE J. on Selected Areas in Comm. 8(6) (1990)

    Google Scholar 

  5. Daniels, H.E., Skyrme, T.H.R.: The maximum of a random walk whose mean path has a maximum. Adv. Appl. Probab. 17, 85–99 (1985)

    Article  MathSciNet  Google Scholar 

  6. Erlebach, T., Jansen, K.: Call scheduling in trees, rings and meshes. In: Proc. of HICSS-30, vol. 1, pp. 221–222. IEEE CS Press, Los Alamitos (1997)

    Google Scholar 

  7. Erlebach, T., Jansen, K., Kaklamanis, C., Mihail, M., Persiano, P.: Optimal wavelength routing on directed fiber trees. Theoret. Comput. Sci. 221(1-2), 119–137 (1999)

    Article  MathSciNet  Google Scholar 

  8. Flajolet, P.: Combinatorial aspects of continued fractions. Discrete Math. 32, 125–161 (1980)

    Article  MathSciNet  Google Scholar 

  9. Françon, J., Viennot, X.: Permutations selon leurs pics, creux, doubles montées et doubles descentes, nombres d’Euler et nombres de Genocchi. Discrete Math. 28, 21–35 (1979)

    Article  MathSciNet  Google Scholar 

  10. Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of colouring circular arcs and chords. SIAM J. Alg. Disc. Meth. 1(2), 216–227 (1980)

    Article  Google Scholar 

  11. Gargano, L., Hell, P., Perennes, S.: Coloring all directed paths in a symmetric tree with applications to WDM routing. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 505–515. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  12. Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)

    MATH  Google Scholar 

  13. Gu, Q.-P., Tamaki, H.: Routing a permutation in the Hypercube by two sets of edgedisjoint paths. In: Proc. of 10th IPPS. IEEE CS Press, Los Alamitos (1996)

    Google Scholar 

  14. Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: Efficient algorithms for interval graphs and circular-arc graphs. Networks 12, 459–467 (1982)

    Article  MathSciNet  Google Scholar 

  15. Kumar, S.R., Panigrahy, R., Russel, A., Sundaram, R.: A note on optical routing on trees. Inf. Process. Lett. 62, 295–300 (1997)

    Article  MathSciNet  Google Scholar 

  16. Louchard, G.: Random walks, Gaussian processes and list structures. Theoret. Comput. Sci. 53, 99–124 (1987)

    Article  MathSciNet  Google Scholar 

  17. Paterson, M., Schröder, H., Sýkora, O., Vrto, I.: On Permutation Communications in All-Optical Rings. In: Proc. of SIROCCO (1998)

    Google Scholar 

  18. Raghavan, P., Upfal, U.: Efficient routing in all optical networks. In: Proc. of the 26th ACM STOC, pp. 133–143 (1994)

    Google Scholar 

  19. Tucker, A.: Coloring a family of circular arcs. SIAM J. Appl. Maths. 29(3), 493–502 (1975)

    Article  MathSciNet  Google Scholar 

  20. Viennot, X.: A combinatorial theory for general orthogonal polynomials with extensions and applications. Lect. Notes Math. 1171, 139–157 (1985); Polynômes orthogonaux et applications, Proc. Laguerre Symp., Bar-le-Duc/France (1984)

    Article  MathSciNet  Google Scholar 

  21. Viennot, X.: Une théorie combinatoire des polynômes orthogonaux généraux. Notes de conférences, Univ. Quebec, Montréal (1985)

    Google Scholar 

  22. Wilfong, G., Winkler, P.: Ring routing and wavelength translation. In: Proc. of the 9th Annual ACM-SIAM SODA, pp. 333–341 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. PRiSM, Université de Versailles, 45 Av. des Etats Unis, 78035, VERSAILLES, France

    D. Barth & D. Gardy

  2. L.R.I., Bât 490, Université Paris-Sud, 91405, ORSAY, France

    S. Corteel, A. Denise & M. Valencia-Pabon

Authors
  1. D. Barth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Corteel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Denise
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. D. Gardy
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. M. Valencia-Pabon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ETH Zurich, Institute of Computational Science, CH-8092 Zurich and, Swiss Institute of Bioinformatics, Switzerland

    Gaston H. Gonnet

  2. Pedeciba Informática, Casilla de Correo 16120, Distrito 6, Montevideo, Uruguay

    Alfredo Viola

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barth, D., Corteel, S., Denise, A., Gardy, D., Valencia-Pabon, M. (2000). On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_32

Download citation

  • DOI: https://doi.org/10.1007/10719839_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67306-4

  • Online ISBN: 978-3-540-46415-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation