#### Filter Results:

#### Publication Year

1975

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Cell Type

#### Key Phrases

#### Organism

Learn More

Graph mining is an important research area within the domain of data mining. The field of study concentrates on the identification of frequent subgraphs within graph data sets. The research goals are directed at: (i) effective mechanisms for generating candidate subgraphs (without generating duplicates) and (ii) how best to process the generated candidate… (More)

In this paper we consider the approximability of the maximum induced matching problem. We prove that there is some xed constant c such that the problem of approximating a maximum induced matching in 3s-regular graphs within a factor of c is NP-hard, for each s 1. In addition we give an approximation algorithm with asymptotic performance ratio d ? 1 for the… (More)

- M F Casanova, M Zito, T Goldberg, A Abi-Dargham, R Sanders, L B Bigelow +2 others
- Schizophrenia research
- 1990

- Michele Zito
- ESA
- 2001

In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the minimum vertex cover (MVC), minimum independent dominating set (MIDS) and minimum edge dominating set (MEDS) problems. In almost all cases we are able to improve the best known… (More)

The problem of determining the unsatisfiability threshold for random 3-SAT formulas consists in determining the clause to variable ratio that marks the experimentally observed abrupt change from almost surely satisfiable formulas to almost surely unsatisfiable. Up to now, there have been rigorously established increasingly better lower and upper bounds to… (More)

The problem of determining the unsatisfiability threshold for random 3-SAT formulas consists in determining the clause to variable ratio that marks the (experimentally observed) abrupt change from almost surely satisfiable formulas to almost surely unsatisfiable. Up to now, there have been rigorously established increasingly better lower and upper bounds to… (More)

- I. Adam, R. Aleksan, L. Amerman, E. Antokhin, D. Aston, P. Bailly +90 others
- 2004

A new type of ring-imaging Cherenkov detector is being used for hadronic particle identification in the BABAR experiment at the SLAC B Factory (PEP-II). This detector is called DIRC, an acronym for Detection of Internally Reflected Cherenkov (Light). This paper will discuss the construction, operation and performance of the BABAR DIRC in detail.

Web traversal robots are used by search engines and in other applications to gather information periodically from large numbers of documents distributed throughout the Web. In this paper we study the issues involved in the design of algorithms for performing information gathering of this kind more eeciently, by taking advantage of anticipated variations in… (More)

In this paper we consider the problem of finding large collections of vertices and edges satisfying particular separation properties in random regular graphs of degree r, for each fixed r ≥ 3. We prove both constructive lower bounds and combinatorial upper bounds on the maximal sizes of these sets. The lower bounds are proved by analysing a class of… (More)