Sciweavers

1188 search results - page 41 / 238
» Extended Graph Unification
Sort
View
IWINAC
2005
Springer
14 years 3 months ago
Self Assembling Graphs
A self-assembly algorithm for synchronising agents and have them arrange according to a particular graph is given. This algorithm, expressed using an ad hoc rule-based process alge...
Vincent Danos, Fabien Tarissan
LATIN
1995
Springer
14 years 1 months ago
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
David Fernández-Baca, Giora Slutzki
DAM
2006
91views more  DAM 2006»
13 years 10 months ago
Precoloring extension on unit interval graphs
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...
Dániel Marx
ICCS
2009
Springer
14 years 4 months ago
Conceptual Graph Rules and Equivalent Rules: A Synthesis
This paper is an extended abstract of the talk given at ICCS’09. Rules have long been considered as an essential component of knowledge-based systems. We focus here on conceptual...
Marie-Laure Mugnier
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 11 months ago
Clustering by weighted cuts in directed graphs
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
Marina Meila, William Pentney