Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Fundamentals of Computation Theory: International Conference FCT ' 87 Kazan, USSR, June 22-26, 1987. Proceedings > Fast parallel algorithms for optimal edge-colouring of some tree-structured graphs
Fundamentals of Computation Theory: International Conference FCT ' 87 Kazan, USSR, June 22-26, 1987. Proceedings |
Lothar Budach; Rais G. Bukharajev; Oleg B. Lupanov
Springer Berlin Heidelberg
Fundamentals of Computation Theory: International Conference FCT ' 87 Kazan, USSR, June 22-26, 1987. Proceedings
Fast parallel algorithms for optimal edge-colouring of some tree-structured graphs
Authors

Alan Gibbons; Wojciech Rytter

ARI Id

1664258349042_954909

Access

Not Available Free

Pages

155-162

DOI

10.1007/3-540-18740-5_36

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-18740-5_36

Table of Contents of Book
Showing 1 to 20 of 111 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Possibilities of probabilistic on-line counting machines
Farid. M. Ablaev
1-4
Functional systems on semilattices
G. P. Agibalov
5-9
Recognition of properties in k-valued logic and approximate algorithms
V. B. Alekseyev
10-13
Linearized disjunctive normal forms of boolean functions
A. A. Alexanyan
14-16
On a stable generating of random sequences by probabilistic automata
Ju. A. Al'; pin; B. S. Kotchkarev; R. G. Mubarakzianov
17-20
Automata classes induced by Post classes
S. V. Alyoshin
21-23
Effective lower bounds for complexity of some classes of schemes
A. E. Andreev
24-29
Stable finite automata mappings and Church-Rosser systems
A. V. Anisimov; V. A. Oleshchuk
30-33
The recursion theorem, approximations, and classifying index sets of recursively enumerable sets
M. M. Arslanov
34-37
Duality of functions and data in algorithms description
A. D. Astakhov
38-40
On direct methods of realization of normal algorithms by turing machines
G. V. Babikov
41-41
Verbal operation on automaton
D. N. Babin
42-44
The new way of probabilistic compact testing
A. S. Barashko
45-47
Computational problems in alphabetic coding theory
M. Yu. Baryshev; L. P. Zhil'; tzova; A. A. Markov
48-50
On the synthesis of "Irredundant" automata from a finite set of experiments
S. A. Bogomolov
51-52
On the equivalence problem of states for cellular automata
A. A. Bolotov
53-54
Arsenals and lower bounds
Lothar Budach
55-64
Chain — like model of programs communication
R. G. Bukharajev; A. I. Enikeev; I. I. Makarov
65-67
Structor automata
R. G. Bukharajev; I. R. Nasirov
68-73
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 111 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings