Sciweavers

4074 search results - page 158 / 815
» Abstract Graph Transformation
Sort
View
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 2 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
WADS
2009
Springer
281views Algorithms» more  WADS 2009»
15 years 8 months ago
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Krishnam Raju Jampani, Anna Lubiw
IJCAI
2003
15 years 3 months ago
Generalizing GraphPlan by Formulating Planning as a CSP
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
Adriana Lopez, Fahiem Bacchus
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
15 years 8 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 9 months ago
Partition Functions of Normal Factor Graphs
—One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After “normalization,” a sum ...
G. David Forney Jr., Pascal O. Vontobel