(UL)
-
Graph and map isomorphism and all polyhedral embeddings in linear time [Elektronski vir]Kawarabayashi, Ken-ichi ; Mohar, Bojan, 1956-For every surface ▫$S$▫ (orientable or non-orientable), we give a linear time algorithm to test the graph isomorphism of two graphs, one of which admits an embedding of face-width at least 3 into ... ▫$S$▫. This improves a previously known algorithm whose time complexity is ▫$n^{O(g)}$▫, where ▫$g$▫ is the genus of ▫$S$▫. This is the first algorithm for which the degree of polynomial in the time complexity does not depend on ▫$g$▫. The above result is based on two linear time algorithms, each of which solves a problem that is of independent interest. The first of these problems is the following one. Let ▫$S$▫ be a fixed surface. Given a graph ▫$G$▫ and an integer ▫$k \geq 3$▫, we want to find an embedding of ▫$G$▫ in ▫$S$▫ of face-width at least ▫$k$▫, or conclude that such an embedding does not exist. It is known that this problem is NP-hard when the surface is not fixed. Moreover, if there is an embedding, the algorithm can give all embeddings of face-width at least ▫$k$▫, up to Whitney equivalence. Here, the face-width of an embedded graph ▫$G$▫ is the minimum number of points of ▫$G$▫ in which some non-contractible closed curve in the surface intersects the graph. In the proof of the above algorithm, we give a simpler proof and a better bound for the theorem by Mohar and Robertson concerning the number of polyhedral embeddings of 3-connected graphs. The second ingredient is a linear time algorithm for map isomorphism and Whitney equivalence. This part generalizes the seminal result of Hopcroft and Wong that graph isomorphism can be decided in linear time for planar graphs.Vir: Preprint series. - ISSN 1318-4865 (Vol. 47, št. 1069, 2009, str. 1-23)Vrsta gradiva - e-članekLeto - 2009Jezik - angleškiCOBISS.SI-ID - 15048025
Avtor
Kawarabayashi, Ken-ichi |
Mohar, Bojan, 1956-
Teme
teorija grafov |
izomorfizem grafov |
izomorfizem preslikav |
algoritem linearne časovne zahtevnosti |
ploskev |
celična širina |
polinomska vložitev |
graph theory |
graph isomorphism |
map isomorphism |
linear time algorithm |
surface |
face-width |
polyhedral embedding
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|---|
Kawarabayashi, Ken-ichi | ![]() |
Mohar, Bojan, 1956- | 01931 |
Vir: Osebne bibliografije
in: SICRIS
Izberite prevzemno mesto:
Prevzem gradiva po pošti
Naslov za dostavo:
Med podatki člana manjka naslov.
Storitev za pridobivanje naslova trenutno ni dostopna, prosimo, poskusite še enkrat.
S klikom na gumb "V redu" boste potrdili zgoraj izbrano prevzemno mesto in dokončali postopek rezervacije.
S klikom na gumb "V redu" boste potrdili zgoraj izbrano prevzemno mesto in naslov za dostavo ter dokončali postopek rezervacije.
S klikom na gumb "V redu" boste potrdili zgoraj izbrani naslov za dostavo in dokončali postopek rezervacije.
Obvestilo
Trenutno je storitev za avtomatsko prijavo in rezervacijo nedostopna. Gradivo lahko rezervirate sami na portalu Biblos ali ponovno poskusite tukaj kasneje.
Gesla v Splošnem geslovniku COBISS
Izbira mesta prevzema
Gradivo iz matične enote je brezplačno. Če je gradivo na mesto prevzema dostavljeno iz drugih enot, lahko knjižnica to storitev zaračuna.
Mesto prevzema | Status gradiva | Rezervacija |
---|
Rezervacija v teku
Prosimo, počakajte trenutek.
Rezervacija je uspela.
Rezervacija ni uspela.
Rezervacija...
Članska izkaznica:
Mesto prevzema: