Scheduled hot-potato routing.
Page 1 Next
Naor, Joseph, Orda, Ariel, Rom, Raphael (1998)
Journal of Graph Algorithms and Applications
Kashiwabara, Kenji (2009)
The Electronic Journal of Combinatorics [electronic only]
Stefanakis, Emmanuel (2004)
Acta Universitatis Apulensis. Mathematics - Informatics
Marietjie Frick, Bernardo Llano, Rita Zuazua (2015)
Mathematica Bohemica
We study a particular digraph dynamical system, the so called digraph diclique operator. Dicliques have frequently appeared in the literature the last years in connection with the construction and analysis of different types of networks, for instance biochemical, neural, ecological, sociological and computer networks among others. Let be a reflexive digraph (or network). Consider and (not necessarily disjoint) nonempty subsets of vertices (or nodes) of . A disimplex of is the subdigraph...
Goemans, Michel X. (1998)
Documenta Mathematica
L. Boneva (1980)
Banach Center Publications
Robert Cori, Thi Ha Duong Phan, Thi Thu Huong Tran (2013)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
We investigate the Sandpile Model and Chip Firing Game and an extension of these models on cycle graphs. The extended model consists of allowing a negative number of chips at each vertex. We give the characterization of reachable configurations and of fixed points of each model. At the end, we give explicit formula for the number of their fixed points.
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Erten, Cesim, Kobourov, Stephen G. (2005)
Journal of Graph Algorithms and Applications
Erten, C., Kobourov, S.G., Le, V., Navabi, A. (2005)
Journal of Graph Algorithms and Applications
Xavier Messeguer (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Eppstein, David (2003)
Journal of Graph Algorithms and Applications
Ausiello, Giorgio, Franciosa, Paolo G., Italiano, Giuseppe F. (2006)
Journal of Graph Algorithms and Applications
J. Almeida (1984)
Semigroup forum
Kathie Cameron, Jack Edmonds (1999)
Annales de l'institut Fourier
Vertex-degree parity in large implicit “exchange graphs” implies some EP theorems asserting the existence of a second object without evidently providing a polytime algorithm for finding a second object.
Dragoš Cvetković, Irena Pevac (1984)
Publications de l'Institut Mathématique
Cvetković, Dragoš, Pevac, Irena (1984)
Publications de l'Institut Mathématique. Nouvelle Série
D. Bienstock (1991)
Discrete & computational geometry
Sun, Ling-li (2007)
Applied Mathematics E-Notes [electronic only]
Dragoš Cvetković (2012)
The Yugoslav Journal of Operations Research
Page 1 Next