2-layer routing of dense bipartite specifications with vertex disjoint paths and via holes

Algorithmen fuer das Routing in planaren Graphen

Becker, M.
Mehlhorn, K.
Saarland Univ., Saarbruecken (Germany). Fachbereich 10 - Angewandte Mathematik und Informatik

January 1984

Available from TIB Hannover: RN 3144(1984,07) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Tec...

Algorithmic and complexity aspects of path computation in multi-layer networks

Lamali, Mohamed Lamine
Fergani, Nasreddine
Cohen, Johanne

January 2018

International audienceCarrier-grade networks comprise several layers where different protocols coexi...

Algorithmic and complexity aspects of path computation in multi-layer networks

Lamali, Mohamed Lamine
Fergani, Nasreddine
Cohen, Johanne

January 2018

International audienceCarrier-grade networks comprise several layers where different protocols coexi...

Homotopic routing methods

Schrijver, A.

January 1988

Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...

Routing multiterminal nets via disjoint connected t-joins

Middendorf, M.
Pfeiffer, Frank

January 1988

Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...

Routing problems in grid graphs

Kaufmann, Michael
Mehlhorn, Kurt

January 1989

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Routing multiterminal nets via disjoint connected t-joints

Middendorf, M.
Pfeiffer, F.
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten

January 1988

SIGLETIB Hannover: RN 4052(88511-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische I...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, W
Renssen, AM André van
Roeloffzen, MJM Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, B
Willert, Max

January 2017

\u3cp\u3eWe consider the problem of routing a data packet through the visibility graph of a polygona...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, W
Renssen, AM André van
Roeloffzen, MJM Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, B
Willert, Max

January 2020

\u3cp\u3eWe consider the problem of routing a data packet through the visibility graph of a polygona...

Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterfly, Mesh of Trees, Fat Trees and Beneˇs Networks

Tiziana Calamoneri
Miriam Di Ianni

January 2003

Abstract. In this paper we propose compact routing schemes having space and time complexities compar...

A New Two-Dimensional Routing Algorithm

Chi-ping Hsu

November 2014

A new heur is t ic a lgor i thm for two-dimensional rout-ing uti l izing two d ist inct layers is de...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, Wolfgang
van Renssen, André
Roeloffzen, Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, Birgit
Willert, Max

April 2020

We consider the problem of routing a data packet through the visibility graph of a polygonal domain ...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, Wolfgang
van Renssen, André
Roeloffzen, Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, Birgit
Willert, Max

April 2020

We consider the problem of routing a data packet through the visibility graph of a polygonal domain ...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, Wolfgang
van Renssen, André
Roeloffzen, Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, Birgit
Willert, Max

April 2020

We consider the problem of routing a data packet through the visibility graph of a polygonal domain ...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, Wolfgang
van Renssen, André
Roeloffzen, Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, Birgit
Willert, Max

April 2020

We consider the problem of routing a data packet through the visibility graph of a polygonal domain ...

Algorithmen fuer das Routing in planaren Graphen

Becker, M.
Mehlhorn, K.
Saarland Univ., Saarbruecken (Germany). Fachbereich 10 - Angewandte Mathematik und Informatik

January 1984

Available from TIB Hannover: RN 3144(1984,07) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Tec...

Algorithmic and complexity aspects of path computation in multi-layer networks

Lamali, Mohamed Lamine
Fergani, Nasreddine
Cohen, Johanne

January 2018

International audienceCarrier-grade networks comprise several layers where different protocols coexi...

Algorithmic and complexity aspects of path computation in multi-layer networks

Lamali, Mohamed Lamine
Fergani, Nasreddine
Cohen, Johanne

January 2018

International audienceCarrier-grade networks comprise several layers where different protocols coexi...

Homotopic routing methods

Schrijver, A.

January 1988

Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...

Routing multiterminal nets via disjoint connected t-joins

Middendorf, M.
Pfeiffer, Frank

January 1988

Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...

Routing problems in grid graphs

Kaufmann, Michael
Mehlhorn, Kurt

January 1989

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Routing multiterminal nets via disjoint connected t-joints

Middendorf, M.
Pfeiffer, F.
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten

January 1988

SIGLETIB Hannover: RN 4052(88511-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische I...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, W
Renssen, AM André van
Roeloffzen, MJM Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, B
Willert, Max

January 2017

\u3cp\u3eWe consider the problem of routing a data packet through the visibility graph of a polygona...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, W
Renssen, AM André van
Roeloffzen, MJM Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, B
Willert, Max

January 2020

\u3cp\u3eWe consider the problem of routing a data packet through the visibility graph of a polygona...

Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterfly, Mesh of Trees, Fat Trees and Beneˇs Networks

Tiziana Calamoneri
Miriam Di Ianni

January 2003

Abstract. In this paper we propose compact routing schemes having space and time complexities compar...

A New Two-Dimensional Routing Algorithm

Chi-ping Hsu

November 2014

A new heur is t ic a lgor i thm for two-dimensional rout-ing uti l izing two d ist inct layers is de...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, Wolfgang
van Renssen, André
Roeloffzen, Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, Birgit
Willert, Max

April 2020

We consider the problem of routing a data packet through the visibility graph of a polygonal domain ...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, Wolfgang
van Renssen, André
Roeloffzen, Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, Birgit
Willert, Max

April 2020

We consider the problem of routing a data packet through the visibility graph of a polygonal domain ...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, Wolfgang
van Renssen, André
Roeloffzen, Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, Birgit
Willert, Max

April 2020

We consider the problem of routing a data packet through the visibility graph of a polygonal domain ...

Routing in polygonal domains

Banyassady, Bahareh
Chiu, Man Kwun
Korman, Matias
Mulzer, Wolfgang
van Renssen, André
Roeloffzen, Marcel
Seiferth, Paul
Stein, Yannik
Vogtenhuber, Birgit
Willert, Max

April 2020

We consider the problem of routing a data packet through the visibility graph of a polygonal domain ...

Algorithmen fuer das Routing in planaren Graphen

Becker, M.
Mehlhorn, K.
Saarland Univ., Saarbruecken (Germany). Fachbereich 10 - Angewandte Mathematik und Informatik

January 1984

Available from TIB Hannover: RN 3144(1984,07) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Tec...

Algorithmic and complexity aspects of path computation in multi-layer networks

Lamali, Mohamed Lamine
Fergani, Nasreddine
Cohen, Johanne

January 2018

International audienceCarrier-grade networks comprise several layers where different protocols coexi...

Algorithmic and complexity aspects of path computation in multi-layer networks

Lamali, Mohamed Lamine
Fergani, Nasreddine
Cohen, Johanne

January 2018

International audienceCarrier-grade networks comprise several layers where different protocols coexi...

2-layer routing of dense bipartite specifications with vertex disjoint paths and via holes

Abstract

Extracted data

2-layer routing of dense bipartite specifications with vertex disjoint paths and via holes

Abstract

Extracted data

Related items

Related items