✦ LIBER ✦

Combinatorial algorithms on a class of graphs

✍ Scribed by N.M. Korneyenko

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 200 KB
Volume: 54
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90022-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial games on a graph

✍ Claude Berge 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Survey of various problems about combinatorial games. ## O. Introduction A combinatorial game is the situation where two players, usually called A and B, play alternately by selecting an element in a finite set X according to fixed rules; the first player to achieve a certain configuration has wo

Deriving a class of layer-oriented graph

Deriving a class of layer-oriented graph algorithms

✍ Martin Russling 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 997 KB

Parallel algorithms on graphs

✍ E. A. Ivanov 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 339 KB

A class of bounded approximation algorit

A class of bounded approximation algorithms for graph partitioning

✍ Thomas A. Feo; Mallek Khellaf 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 847 KB

One class of combinatorial identities

✍ E. G. Tsylova 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 392 KB

Orderly algorithms for generating restri

Orderly algorithms for generating restricted classes of graphs

✍ Charles J. Colbourn; Ronald C. Read 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 463 KB

## Abstract Orderly algorithms for the generation of exhaustive lists of nonisomorphic graphs are discussed. The existence of orderly methods to generate the graphs with a given subgraph and without a given subgraph is established. This method can be used to list all the nonisomorphic subgraphs of