3265 search results - page 286 / 653 » Representing Groups on Graphs |
189
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
166
click to vote
HM
2007
Springer
16 years 26 days ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
164
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
178
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
186
click to vote
ICWE
2007
Springer
16 years 26 days ago
2007
Springer
In recent years, innovation in technologies such as web services, business process automation, etc., have motivated a new paradigm in the application development field to appear, k...