researchr - search publication finite graphs

researchr

You are not signed in
Sign in
Sign up

707 publication results matching ' finite graphs'

Update games and update networks
… In this paper we model infinite processes with finite configurations as infinite games over finite graphs. We investigate those games, called \emph{update … (and partial characterization) for deciding if a graph is an \emph{update network}. …
Michael J. Dinneen, Bakhadyr Khoussainov. jda, 1(1):53-65, 2003. [doi]
Update Networks and Their Routing Strategies
… We introduce the notion of update networks to model communication networks with infinite duration. In our formalization we use bipartite finite graphs and game-theoretic terminology as an underlying structure. For these networks we …
Michael J. Dinneen, Bakhadyr Khoussainov. criwg 2000: 127-136 [doi]
Symmetries of finite graphs and homologyBenjamin Atchison, Edward C. Turner. gcc, 7(1):11-30, 2015. [doi]
On the Lattices of Cutsets in Finite GraphsBernd Meyer. ejc, 3(2):153-157, 1982. [doi]
Finite Graph-AutomataKurt-Ulrich Witt. wg 1982: 45-54
Locally finite graphs and embeddingsThomas Tucker. endm, 31:23-25, 2008. [doi]
Generalized inverse of a finite graphM. Mrozek. FUIN, 4(3):499-510, 1981.
Eigenvalues of finite graphsC. Delorme. DM, 114(1-3):137-146, 1993. [doi]
A decomposition of locally finite graphsBogdan Oporowski. DM, 117(1-3):161-168, 1993. [doi]
s-homotopy for finite graphsRomain Boulet, Etienne Fieux, Bertrand Jouve. endm, 31:123-127, 2008. [doi]
On the definability of properties of finite graphsGyörgy Turán. DM, 49(3):291-302, 1984. [doi]
Modal Logics for Finite GraphsMario R. F. Benevides. In Ruy J. G. B. de Queiroz, editor, Logic for Concurrency and Synchronisation. Volume 18 of Trends in Logic, pages 239-267, Kluwer, 2003. [doi]
Weierstrass Sets on Finite GraphsAlessio Borzì. combinatorics, 29(1), 2022. [doi]
Note on limits of finite graphsGábor Elek. combinatorica, 27(4):503-507, 2007. [doi]
Tomography on Finite GraphsAtsushi Imiya, Akihiko Torii, Kosuke Sato. endm, 20:217-232, 2005. [doi]
k-universal finite graphsEric Rosen, Saharon Shelah, Scott Weinstein. dimacs 1997: 65-78
Finite Languages for the Representation of Finite GraphsAndrzej Ehrenfeucht, Joost Engelfriet, Grzegorz Rozenberg. jcss, 52(1):170-184, 1996.
Automatic graphs and D0L-sequences of finite graphsOlivier Ly. jcss, 67(3):497-545, 2003. [doi]
Gaps between Connected Finite GraphsRobert Baldinger, Jonathan P. McCammond. ijac, 2(1):19-32, 1992. [doi]
Diameter of the conjunction of two finite graphsRoger H. Lamprey. jgt, 2(4):357-362, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL