Sciweavers

2503 search results - page 61 / 501
» A study of 3-arc graphs
Sort
View
ACTA
2005
101views more  ACTA 2005»
15 years 5 months ago
A general framework for types in graph rewriting
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Barbara König
KDD
2012
ACM
164views Data Mining» more  KDD 2012»
13 years 8 months ago
SeqiBloc: mining multi-time spanning blockmodels in dynamic graphs
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
Jeffrey Chan, Wei Liu, Christopher Leckie, James B...
DIALM
2003
ACM
133views Algorithms» more  DIALM 2003»
15 years 11 months ago
Ad-hoc networks beyond unit disk graphs
In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical realworld networks whi...
Fabian Kuhn, Aaron Zollinger
AIPS
2008
15 years 8 months ago
Causal Graphs and Structurally Restricted Planning
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...
Hubie Chen, Omer Giménez
ENDM
2007
75views more  ENDM 2007»
15 years 5 months ago
Graph classes with given 3-connected components: asymptotic counting and critical phenomena
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
Omer Giménez, Marc Noy, Juan José Ru...