2125 search results - page 169 / 425 » On Graph Complexity |
105
click to vote
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
114
click to vote
SODA
2010
ACM
16 years 10 days ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
148
click to vote
CC
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
166
click to vote
KI
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
188
click to vote
PODC
2011
ACM
14 years 5 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...