3008 search results - page 16 / 602 » Independence in connected graphs |
105
Voted
AMC
2005
15 years 17 days ago
2005
In this paper, we study graphs that arise from certain sensory and communication limitations on the local interactions in multi-agent systems. In particular, we show that the set ...
101
click to vote
COMBINATORICS
2006
15 years 21 days ago
2006
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
CORR
2010
Springer
15 years 22 days ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
113
click to vote
UAI
2004
15 years 2 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
126
Voted
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...