-
On the complexity of recognizing Hamming graphs and related classes of graphsImrich, Wilfried ; Klavžar, SandiV članku je podan algoritem, ki prepoznava Hammingove grafe v ▫$O(m)$▫ in prostoru ▫$O(n^2)$▫. Narejen je tudi pregled znanih razpoznavnih algoritmov za Hammingove grafe, retrakte Hammingovih grafov ... in izometričnih podgrafov Hammingovih grafov.Source: European journal of combinatorics = Journal européen de combinatoire = Europäische Zeitschrift für Kombinatorik. - ISSN 0195-6698 (Let. 17, št. 2/3, 1996, str. 209-221)Type of material - article, component partPublish date - 1996Language - englishCOBISS.SI-ID - 6009433
Author
Imrich, Wilfried |
Klavžar, Sandi
Topics
matematika |
teorija grafov |
Hammingov graf |
algoritmi |
prepoznavanje |
izometrična vložitev |
medianski graf |
kvazi-medianski graf |
mathematics |
graph theory |
Hamming graph |
algorithms |
recognition |
izometric embedding |
median graph |
quasi-median graph
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|---|
Imrich, Wilfried | 11754 |
Klavžar, Sandi | 05949 |
Select pickup location:
Material pickup by post
Notification
Subject headings in COBISS General List of Subject Headings
Select pickup location
Pickup location | Material status | Reservation |
---|
Please wait a moment.