1188 search results - page 41 / 238 » Extended Graph Unification |
80
Voted
IWINAC
2005
Springer
15 years 6 months ago
2005
Springer
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...
143
Voted
LATIN
1995
Springer
15 years 4 months ago
1995
Springer
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...
105
Voted
DAM
2006
15 years 1 months ago
2006
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 ...
ICCS
2009
Springer
15 years 7 months ago
2009
Springer
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...
103
Voted
SDM
2007
SIAM
15 years 2 months ago
2007
SIAM
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...