Sciweavers

1986 search results - page 172 / 398
» Path Separability of Graphs
Sort
View
FUZZY
2001
Springer
123views Fuzzy Logic» more  FUZZY 2001»
14 years 2 months ago
Analyzing Directed Acyclic Graph Recombination
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
Carlos Cotta, José M. Troya
FASE
1998
Springer
14 years 2 months ago
Compositional Verification of Reactive Systems Specified by Graph Transformation
A loose semantics for graph transformation rules which has been developed recently is used in this paper for the compositional verification of specifications. The main conceptual t...
Reiko Heckel
IDMS
1998
Springer
122views Multimedia» more  IDMS 1998»
14 years 2 months ago
Object Graphs as Pivotal Representations for Hypermedia
This position paper advocates a possible bridging of multiple heterogeneous formats and interfaces for hypermedia data and metadata. Rather than one more text, bit-stream or proced...
Marc Brelot, Gilles Privat
ALT
2008
Springer
14 years 7 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
14 years 4 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier