5100 search results - page 291 / 1020 » The Linear Complexity of a Graph |
133
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
166
click to vote
AGTIVE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For...
134
click to vote
CMSB
2006
Springer
15 years 8 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
147
click to vote
AIPS
2007
15 years 6 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
114
click to vote
FLAIRS
2008
15 years 6 months ago
2008
For many educational applications such as learning tools for argumentation, structured diagrams are a suitable form of external representation. However, student-created graphs pos...