A broadcasting algorithm with time and message optimum on arrangement graphs.
Bai, Leqiang, Maeda, Hajime, Ebara, Hiroyuki, Nakano, Hideo (1998)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A method of constructing the frame of a directed graph”
A broadcasting algorithm with time and message optimum on arrangement graphs.
Graph drawing by high-dimensional embedding.
Harel, David, Koren, Yehuda (2004)
Journal of Graph Algorithms and Applications
Similarity:
Graph drawing in motion.
Friedrich, Carsten, Eades, Peter (2002)
Journal of Graph Algorithms and Applications
Similarity:
Distributed approach for solving time-dependent problems in multimodal transport networks.
Galvez-Fernandez, Carlos, Khadraoui, Djamel, Ayed, Hedi, Habbas, Zineb, Alba, Enrique (2009)
Advances in Operations Research
Similarity:
Centers in iterated line graphs.
Knor, M., Niepel, L., Olts, L. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
A new possibility in bi-directional search
Josef Kolář (1977)
Kybernetika
Similarity:
Centers in line graphs
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity: