✦ LIBER ✦

Construction of the Algorithm Graph by Autotracing Method

✍ Scribed by N. M. Ershov

Book ID: 111565829
Publisher: SP MAIK Nauka/Interperiodica
Year: 2000
Tongue: English
Weight: 79 KB
Volume: 26
Category: Article
ISSN: 0361-7688
DOI: 10.1023/a:1026608606909

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Construction of nonbinary quantum cyclic

Construction of nonbinary quantum cyclic codes by using graph method

✍ Tailin Liu; Qiaoyan Wen; Zihui Liu 📂 Article 📅 2005 🏛 Science in China Press (SCP) 🌐 English ⚖ 159 KB

A polynomial algorithm for constructing

A polynomial algorithm for constructing the clique graph of a line graph

✍ Bruce Hedman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 250 KB

A method for the construction of kinetic

A method for the construction of kinetic graph determinants

✍ Petrov, L. A. ;Shopov, D. M. 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 186 KB

Method of constructing parallel algorith

Method of constructing parallel algorithms

✍ N. N. Mirenkov 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 457 KB

Method for construction of characteristi

Method for construction of characteristic polynomials via graph linearization

✍ Kakali Datta; Asok K. Mukherjee 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

A new method for construction of characteristic polynomials CP of complicated graphs having arbitrary edge and vertex weights has been developed. The method first converts the graph into isospectral linear chains with weighted vertices and edges and then builds up the CP coefficients recursively. Tw

Method for construction of (3, 4)-graphs

✍ D. G. Fon-Der-Flaass 📂 Article 📅 1988 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 181 KB