Sciweavers

3757 search results - page 205 / 752
» The overlap number of a graph
Sort
View
CONCUR
2006
Springer
15 years 10 months ago
Some Remarks on Definability of Process Graphs
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
VISSYM
2007
15 years 9 months ago
Grouse: Feature-Based, Steerable Graph Hierarchy Exploration
Grouse is a feature-based approach to steerable exploration of a graph and an associated hierarchy. Steerability allows exploration to begin immediately, rather than requiring a c...
Daniel Archambault, Tamara Munzner, David Auber
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 8 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter
DM
2010
102views more  DM 2010»
15 years 6 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 6 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...