2125 search results - page 192 / 425 » On Graph Complexity |
129
click to vote
ICWS
2004
IEEE
15 years 4 months ago
2004
IEEE
Service composition refers to the aggregation of services to build complex applications to achieve client requirements. It is an important challenge to make it possible for users ...
126
click to vote
IH
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
135
Voted
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
146
click to vote
BMCBI
2004
15 years 2 months ago
2004
Background: The proliferation of structural and functional studies of RNA has revealed an increasing range of RNA's structural repertoire. Toward the objective of systematic ...
130
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...