3958 search results - page 101 / 792 » Dynamic Graph Algorithms with Applications |
135
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
166
click to vote
BMCBI
2010
15 years 5 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
160
Voted
STOC
2010
ACM
15 years 10 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
148
click to vote
IWOCA
2009
Springer
15 years 11 months ago
2009
Springer
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
139
click to vote
LCTRTS
2007
Springer
15 years 11 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...