3757 search results - page 139 / 752 » The overlap number of a graph |
172
click to vote
WEBDB
2005
Springer
15 years 12 months ago
2005
Springer
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
155
click to vote
WEBDB
2010
Springer
15 years 11 months ago
2010
Springer
For documents with complex or atypical annotations, multihierarchical structures play the role of the document tree in traditional XML documents. We define a model of overlapping...
134
click to vote
DNA
2001
Springer
15 years 11 months ago
2001
Springer
The directed evolution of proteins, using an in vitro domainal shuffling strategy was proposed in (J. Kolkman and W. Stemmer, Nat. Biotech. 19, 423 (2001). Due to backhybridization...
177
click to vote
ADHOCNOW
2008
Springer
16 years 22 days ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
167
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...