-
3
-
-
0022862841
-
Simulation of large networks on smaller networks
-
[BL]
-
[BL] H.-L. Bodlaender and J. Van Leeuwen. Simulation of large networks on smaller networks. Information and Control, 71:143-180, 1986.
-
(1986)
Information and Control
, vol.71
, pp. 143-180
-
-
Bodlaender, H.-L.1
Van Leeuwen, J.2
-
5
-
-
38149145996
-
Coverings and minors: Applications to local computations in graphs
-
[CM]
-
[CM] B. Courcelle and Y. Métivier. Coverings and minors: applications to local computations in graphs. European Journal of Combinatorics, 15:127-138, 1994.
-
(1994)
European Journal of Combinatorics
, vol.15
, pp. 127-138
-
-
Courcelle, B.1
Métivier, Y.2
-
6
-
-
77953892793
-
Small sets supporting Fáry embeddings of planar graphs
-
[DFPP], Chicago. ACM Press, New York, 1988
-
[DFPP] H. De Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fáry embeddings of planar graphs. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, 1988, pages 426-433. ACM Press, New York, 1988.
-
(1988)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing
, pp. 426-433
-
-
De Fraysseix, H.1
Pach, J.2
Pollack, R.3
-
7
-
-
84875562982
-
Decidability questions for graph k-coverings
-
[DZ], LaBRI
-
[DZ] F. Demichelis and W. Zielonka. Decidability questions for graph k-coverings. Technical Report, LaBRI, 1996.
-
(1996)
Technical Report
-
-
Demichelis, F.1
Zielonka, W.2
-
8
-
-
0042864376
-
The Robertson-Seymour theorems: A survey of applications
-
[F]
-
[F] M. R. Fellows. The Robertson-Seymour theorems: a survey of applications. Contemporary Mathematics, 89:1-18, 1989.
-
(1989)
Contemporary Mathematics
, vol.89
, pp. 1-18
-
-
Fellows, M.R.1
-
9
-
-
0022562351
-
Easy impossibility proofs for distributed consensus problems
-
[FLM]
-
[FLM] M. J. Fisher, N. A. Lynch, and M. Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1:26-29, 1986.
-
(1986)
Distributed Computing
, vol.1
, pp. 26-29
-
-
Fisher, M.J.1
Lynch, N.A.2
Merritt, M.3
-
11
-
-
0008713925
-
Characterization of classes of graphs recognizable by local computations with initial knowledge (extended abstract)
-
[GMI], number 11 in Proceedings in Informatics. Carleton Scientific, Ottawa
-
[GMI] E. Godard and Y. Métivier. Characterization of classes of graphs recognizable by local computations with initial knowledge (extended abstract). In SIROCCO 01-8th International Colloquium on Structural Information & Communication Complexity, number 11 in Proceedings in Informatics, pages 179-194. Carleton Scientific, Ottawa, 2001.
-
(2001)
SIROCCO 01-8th International Colloquium on Structural Information & Communication Complexity
, pp. 179-194
-
-
Godard, E.1
Métivier, Y.2
-
12
-
-
84855344139
-
A characterization of families of graphs in which election is possible (extended abstract)
-
[GM2]. M. Nielsen and U. Engberg, editors, number 2303 in LNCS. Springer-Verlag, Berlin
-
[GM2] E. Godard and Y. Métivier. A characterization of families of graphs in which election is possible (extended abstract). In M. Nielsen and U. Engberg, editors, Proceedings of Foundations of Software Science and Computation Structures, FOSSACS '02, number 2303 in LNCS, pages 159-171. Springer-Verlag, Berlin, 2002.
-
(2002)
Proceedings of Foundations of Software Science and Computation Structures, FOSSACS '02
, pp. 159-171
-
-
Godard, E.1
Métivier, Y.2
-
13
-
-
84875558958
-
Equivalence of structural knowledges in distributed algorithms
-
[GM3], number 13 in Proceedings in Informatics,. Carleton Scientific, Ottawa
-
[GM3] E. Godard and Y. Métivier. Equivalence of structural knowledges in distributed algorithms. In SIROCCO 02-9th International Colloquium on Structural Information & Communication Complexity, number 13 in Proceedings in Informatics, pages 149-164. Carleton Scientific, Ottawa, 2002.
-
(2002)
SIROCCO 02-9th International Colloquium on Structural Information & Communication Complexity
, pp. 149-164
-
-
Godard, E.1
Métivier, Y.2
-
14
-
-
84949974308
-
The power of local computations in graphs with initial knowledge
-
[GMM], number 1764 in LNCS,. Springer, Berlin
-
[GMM] E. Godard, Y. Métivier, and A. Muscholl. The power of local computations in graphs with initial knowledge. In Proceedings of Theory and Applications of Graph Transformations '98, number 1764 in LNCS, pages 71-84. Springer, Berlin, 2000.
-
(2000)
Proceedings of Theory and Applications of Graph Transformations '98
, pp. 71-84
-
-
Godard, E.1
Métivier, Y.2
Muscholl, A.3
-
18
-
-
0347466287
-
Graph relabelling systems and distributed algorithms
-
[LMS2]. H. Ehrig, H.J. Kreowski, U. Montanari, and G. Rozenberg, editors,. World Scientific, Singapore
-
[LMS2] I. Litovsky, Y. Métivier, and E. Sopena. Graph relabelling systems and distributed algorithms. In H. Ehrig, H.J. Kreowski, U. Montanari, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 3, pages 1-56. World Scientific, Singapore, 1999.
-
(1999)
Handbook of Graph Grammars and Computing by Graph Transformation
, vol.3
, pp. 1-56
-
-
Litovsky, I.1
Métivier, Y.2
Sopena, E.3
-
19
-
-
0000870945
-
On the recognition of families of graphs with local computations
-
[LMZ]
-
[LMZ] I. Litovsky, Y. Métivier, and W. Zielonka. On the recognition of families of graphs with local computations. Information and Computation, 118(1):110-119, 1995.
-
(1995)
Information and Computation
, vol.118
, Issue.1
, pp. 110-119
-
-
Litovsky, I.1
Métivier, Y.2
Zielonka, W.3
-
21
-
-
85034819445
-
Trace theory
-
[M2]. W. Brauer et al., editor, Petri Nets, volume 255 of LNCS,. Springer-Verlag, Berlin
-
[M2] A. Mazurkiewicz. Trace theory. In W. Brauer et al., editor, Petri Nets, Applications and Relationship to Other Models of Concurrency, volume 255 of LNCS, pages 279-324. Springer-Verlag, Berlin, 1987.
-
(1987)
Applications and Relationship to Other Models of Concurrency
, pp. 279-324
-
-
Mazurkiewicz, A.1
-
23
-
-
0013189328
-
About the local detection of termination of local computations in graphs
-
[MMW]. D. Krizanc and P. Widmayer, editors, Proceedings in Informatics, . Carleton Scientific, Ottawa
-
[MMW] Y. Métivier, A. Muscholl, and P.-A. Wacrenier. About the local detection of termination of local computations in graphs. In D. Krizanc and P. Widmayer, editors, SIROCCO 97-4th International Colloquium on Structural Information & Communication Complexity, Proceedings in Informatics, pages 188-200. Carleton Scientific, Ottawa, 1997.
-
(1997)
SIROCCO 97-4th International Colloquium on Structural Information & Communication Complexity
, pp. 188-200
-
-
Métivier, Y.1
Muscholl, A.2
Wacrenier, P.-A.3
-
25
-
-
0011716017
-
What can be computed locally?
-
[NS]
-
[NS] M. Naor and L. Stockmeyer. What can be computed locally? SIAM Journal on Computing, 24(6):1259-1277, 1995.
-
(1995)
SIAM Journal on Computing
, vol.24
, Issue.6
, pp. 1259-1277
-
-
Naor, M.1
Stockmeyer, L.2
-
28
-
-
0004499550
-
Intelligent graphs
-
[RFH]. R. Read, editor,. Academic Press, New York
-
[RFH] P. Rosenstiehl, J.-R. Fiksel, and A. Holliger. Intelligent graphs. In R. Read, editor, Graph Theory and Computing, pages 219-265. Academic Press, New York, 1972.
-
(1972)
Graph Theory and Computing
, pp. 219-265
-
-
Rosenstiehl, P.1
Fiksel, J.-R.2
Holliger, A.3
-
29
-
-
45449125778
-
Graph minors, VII: Disjoint paths on a surface
-
[RS]
-
[RS] N. Robertson and P. Seymour. Graph minors, VII: disjoint paths on a surface. Journal of Combinatorial Theory, Series B, 45:212-254, 1988.
-
(1988)
Journal of Combinatorial Theory, Series B
, vol.45
, pp. 212-254
-
-
Robertson, N.1
Seymour, P.2
-
32
-
-
0029752472
-
Computing on anonymous networks: Part I - Characterizing the solvable cases
-
[YK1]
-
[YK1] M. Yamashita and T. Kameda. Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Transactions on Parallel and Distributed Systems, 7(1):69-89, 1996.
-
(1996)
IEEE Transactions on Parallel and Distributed Systems
, vol.7
, Issue.1
, pp. 69-89
-
-
Yamashita, M.1
Kameda, T.2
-
33
-
-
0029755514
-
Computing on anonymous networks: Part II - Decision and membership problems
-
[YK2]
-
[YK2] M. Yamashita and T. Kameda. Computing on anonymous networks: Part II - decision and membership problems. IEEE Transactions on Parallel and Distributed Systems, 7(1):90-96, 1996.
-
(1996)
IEEE Transactions on Parallel and Distributed Systems
, vol.7
, Issue.1
, pp. 90-96
-
-
Yamashita, M.1
Kameda, T.2
-
34
-
-
0033185158
-
Leader election problem on networks in which processor identity numbers are not distinct
-
[YK3]
-
[YK3] M. Yamashita and T. Kameda. Leader election problem on networks in which processor identity numbers are not distinct. IEEE Transactions on Parallel and Distributed Systems, 10(9):878-887, 1999.
-
(1999)
IEEE Transactions on Parallel and Distributed Systems
, vol.10
, Issue.9
, pp. 878-887
-
-
Yamashita, M.1
Kameda, T.2
|