| |
 |
|
|
Hoffmann, Christoph
Purdue University
West Lafayette, Indiana
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 12
reviews
|
|
|
|
|
|
|
|
Visual computing
Kunii T. Visual computing, Tokyo, Japan, Jun 22-26, 1992,1992. Type: Whole Proceedings
The theme of this conference, “Visual Computing--Integrating Computer Graphics with Computer Vision,” sets the stage for a broad range of research papers that have been organized into 15 chapters. These ...
|
Apr 1 1993 |
|
|
|
|
|
|
Recognizing circle graphs in polynomial time
Gabor C., Supowit K., Hsu W. Journal of the ACM 36(3): 435-473, 1989. Type: Article
A circle graph is one that can be considered the model of a set of chords in the following way. Let the vertices of the graph be the given chords. An edge connects chord i and chord j if and only i...
|
Jun 1 1990 |
|
|
|
|
|
|
Incremental modular decomposition
Muller J., Spinrad J. Journal of the ACM 36(1): 1-19, 1989. Type: Article
The paper presents an incremental O(n:0s2) algorithm for finding a modular decomposition of a graph with n vertices. A subset U of the graph vertices V induces a module if, for every vertex w n...
|
May 1 1990 |
|
|
|
|
|
|
Maximum weight independent set in trees
Pawagi S. BIT 27(2): 170-180, 1987. Type: Article
Consider an undirected graph whose vertices are weighted. Finding an independent vertex set maximizing the sum of the weights is in general NP-hard. The problem remains NP-hard for planar graphs but is tractable in chordal graphs and...
|
May 1 1988 |
|
|
|
|
|
|
On iterative methods in Markov modelling
Schatte P. Journal of Information Processing and Cybernetics 23(1): 49-51, 1987. Type: Article
It is shown that the deletion of row i and column i in an irreducible stochastic matrix results in a matrix of spectral radius less than 1. It is proposed to use this fact for iteratively solving systems of linear equatio...
|
Oct 1 1987 |
|
|
|
|
|
|
Efficient algorithms for finding maximum matching in graphs
Galil Z. ACM Computing Surveys 18(1): 23-38, 1986. Type: Article
Four matching problems and their algorithmic solutions are surveyed. The survey is intended to provide a case study for good algorithm design. The four problems considered are as follows:...
|
Feb 1 1987 |
|
|
|
|
|
|
Compiling pattern matching
Augustsson L. Functional programming languages and computer architecture (, Nancy, France, 3811985. Type: Proceedings
Expression matching is used in a variety of experimental programming languages. The paper explains how the matching process in the LML language are compiled into code. In LML, expressions are matched in preorder. Since the language fea...
|
Nov 1 1986 |
|
|
|
|
|
|
A taxonomy of problems with fast parallel algorithms
Cook S. (ed) Information and Control 64(1-3): 2-22, 1985. Type: Article
By now, a sizable body of literature has accumulated that analyzes the complexity of parallel algorithms. A slight complication arises in that there are a variety of parallel machine models to choose from, and that this choice influenc...
|
Sep 1 1986 |
|
|
|
|
|
|
Complete problems for space bounded subclasses of NP
Chung M., Evangelist W., Sudborough I. Acta Informatica 22(4): 379-395, 1985. Type: Article
Consider laying out a graph by placing its vertices in a straight line, in some order, and drawing its edges accordingly. Such a layout has bandwidth k if each graph edge has to span at most k consecutive vertices. Define...
|
Jul 1 1986 |
|
|
|
|
|
|
A fast parallel algorithm for the maximal independent set problem
Karp R., Wigderson A. Journal of the ACM 32(4): 762-773, 1985. Type: Article
An independent set of a simple graph is a subset of vertices, no two of which are adjacent. The paper describes a P-RAM algorithm to determine a maximal independent set for a given graph. The bounds achieved are O((logn)<...
|
Mar 1 1986 |
|
|
|
|
|
| |
|
|
| |
|
|
