1883 search results - page 100 / 377 » Ordered theta graphs |
JUCS
2007
13 years 7 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
CPC
1998
13 years 7 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
DAM
2007
13 years 7 months ago
2007
This work describes a study on the generation of bicliques of a graph. We show that it is NP-complete to test whether a subset of the vertices of a graph is part of a biclique. We ...
AGTIVE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this short paper we describe the setup and results of a new initiative to compare graph transformation tools, carried out as part of the AGTIVE 2007 symposium on “Ap...
WIRN
2005
Springer
14 years 1 months ago
2005
Springer
Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional ac...