Sciweavers

368 search results - page 32 / 74
» Higher Eigenvalues of Graphs
Sort
View
SCP
1998
134views more  SCP 1998»
14 years 9 months ago
Abstract Interpretation Using Typed Decision Graphs
Interpretation Using Typed Decision Graphs Laurent Mauborgne LIENS, ´Ecole Normale Sup´erieure, 45 rue d’Ulm, 75230 Paris cedex 05, France Abstract. This article presents a way...
Laurent Mauborgne
ENDM
2008
142views more  ENDM 2008»
14 years 10 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
JCT
2007
78views more  JCT 2007»
14 years 9 months ago
Semisymmetric graphs from polytopes
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we ob...
Barry Monson, Tomaz Pisanski, Egon Schulte, Asia I...
FOCS
2009
IEEE
15 years 4 months ago
Convergence to Equilibrium in Local Interaction Games
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...
Andrea Montanari, Amin Saberi
CORR
2007
Springer
87views Education» more  CORR 2007»
14 years 9 months ago
Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
Animashree Anandkumar, Lang Tong, Ananthram Swami