Regular ArticleCompact-Port Routing Models and Applications to Distance-Hereditary Graphs☆
References (30)
- et al.
Distance-hereditary graphs
J. Combin. Theory Ser. B
(1986) - et al.
Graph classes between parity and distance-hereditary graphs
Discrete Appl. Math.
(Aug. 1999) - et al.
On devising boolean routing schemes
Theoret. Comput. Sci.
(1997) - et al.
Worst case bounds for shortest path interval routing
J. Algorithms
(1998) - et al.
Completely separable graphs
Discrete Appl. Math.
(1990) - et al.
Technical Report
(1990) - et al.
Graph Classes—A Survey
(1999) - et al.
A linear time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
Networks
(1998) - et al.
Distance-hereditary graphs, steiner trees, and connected domination
SIAM J. Comput.
(1988) A routing algorithm for networks based on distance-hereditary topologies
3rd Int. Colloquium on Structural Information and Communication Complexity (SIROCCO)
(1996)
Dominating cliques in distance-hereditary graphs
4th Scandinavian Workshop on Algorithm Theory (SWAT)
(1994)
The complexity of characterization of networks supporting shortest-path interval routing
4th Colloquium on Structural Information and Communication Complexity (SIROCCO)
(1997)
Distance-hereditary graphs and multidestination message-routing in multicomputers
J. Combin. Math. Combin. Comput.
(1993)
Characterization results of all shortest paths interval routing schemes
5th Colloquium on Structural Information and Communication Complexity (SIROCCO)
(1998)
Cited by (0)
- ☆
This work was partially supported by the EU ESPRIT Long Term Research Project ALCOM-IT under Contract 20244, by the MURST Project “Teoria dei Grafi ed Applicazioni,” and by the Italian “Progetto Cofinanziato: Resource Allocation in Computer Networks.”
- f1
E-mail: [email protected]; [email protected]
- f2
E-mail: [email protected]
Copyright © 2001 Academic Press. All rights reserved.