#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1986

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Laura A. Sanchis
- IEEE Trans. Computers
- 1989

A multiple-block network partitioning algorithm adapted from a two-block iterative improvement partitioning algorithm is presented. This adaptation of the algorithm and of the level gain concept to… (More)

- Laura A. Sanchis
- 1997

A dominating set for a graph G = (V,E) is a subset of vertices V′ ⊆ V such that for all v E V − V′ there exists some u E V′ for which {v, u} E E. The domination number of G is the size of its… (More)

- Laura A. Sanchis
- Algorithmica
- 2001

Abstract We say a vertex v in a graph Gcovers a vertex w if v=w or if v and w are adjacent. A subset of vertices of G is a dominating set if it collectively covers all vertices in the graph. The… (More)

- Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan
- Cliques, Coloring, and Satisfiability
- 1993

We explore neural network and related heuristic methods for the fast approximate solution of the Maximum Clique problem. One of these algorithms, Mean Field Annealing, is implemented on the… (More)

- Laura A. Sanchis
- IEEE Trans. Computers
- 1993

An adaptation to multiple blocks of a two-block network partitioning algorithm by Krishnamurthy was previously presented and analyzed by the author (see ibid., vol.38, p.62-81, 1989). The algorithm… (More)

- Laura A. Sanchis, Arun Jagota
- INFORMS Journal on Computing
- 1996

We describe and analyze test case generators for the maximum clique problem (or equivalently for the maximum independent set or vertex cover problems). The generators produce graphs with specified… (More)

- Laura A. Sanchis
- Discrete Applied Mathematics
- 1995

Abstract In evaluating the performance of approximation algorithms for NP-hard problems, it is often necessary to resort to empirical testing. In order to do such testing it is useful to have test… (More)

- Laura A. Sanchis, Mark A. Fulk
- SIAM J. Comput.
- 1990

Polynomial-time Turing machines that output instances of a given language are considered, where the instances are required to have a certain length specified by the input. Two types of generating… (More)

- Laura A. Sanchis
- Computational Support for Discrete Mathematics
- 1992

- Arun Jagota, Laura A. Sanchis
- J. Heuristics
- 2001

This paper presents some adaptive restart randomized greedy heuristics for MAXIMUM CLIQUE. The algorithms are based on improvements and variations of previously-studied algorithms by the authors.… (More)