(UL)
-
A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width [Elektronski vir]Kawarabayashi, Ken-ichi ; Mohar, Bojan, 1956- ; Reed, BruceFor every fixed surface ▫$S$▫, orientable or non-orientable, and a given graph ▫$G$▫, Mohar (STOC'96 and Siam J. Discrete Math. (1999)) described a linear time algorithm which yields either an ... embedding of ▫$G$▫ in ▫$S$▫ or a minor of ▫$G$▫ which is not embeddable in ▫$S$▫ and is minimal with this property. That algorithm, however, needs a lot of lemmas which spanned six additional papers.In this paper, we give a new linear time algorithm for the same problem. The advantages of our algorithm are the following: (1) The proof is considerably simpler: it needs only about 10 pages, and some results (with rather accessible proofs) from graph minors theory, while Mohar's original algorithm and its proof occupy more than 100 pages in total. (2) The hidden constant (depending on the genus $g$ of the surface ▫$S$▫) is much smaller. It is single exponential in ▫$g$▫, while it is doubly exponential in Mohar's algorithm. As a spin off of our main result, we give another linear time algorithm, which is of independent interest. This algorithm computes the genus and constructs minimum genus embeddings of graphs of bounded tree-width. This resolves a conjecture by Neil Robertson and solves one of the most annoying long standing open question about complexity of algorithms on graphs of bounded tree-width.Source: Preprint series. - ISSN 1318-4865 (Vol. 47, št. 1078, 2009, str. 1-16)Type of material - e-articlePublish date - 2009Language - englishCOBISS.SI-ID - 15050841
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:
If the library membership card is not in the list,
add a new one.
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 |
---|---|
Kawarabayashi, Ken-ichi | |
Mohar, Bojan, 1956- | 01931 |
Reed, Bruce |
Source: Personal bibliographies
and: SICRIS
Select pickup location:
Material pickup by post
Delivery address:
Address is missing from the member's data.
The address retrieval service is currently unavailable, please try again.
By clicking the "OK" button, you will confirm the pickup location selected above and complete the reservation process.
By clicking the "OK" button, you will confirm the above pickup location and delivery address, and complete the reservation process.
By clicking the "OK" button, you will confirm the address selected above and complete the reservation process.
Notification
Automatic login and reservation service currently not available. You can reserve the material on the Biblos portal or try again here later.
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
Pickup location | Material status | Reservation |
---|
Reservation in progress
Please wait a moment.
Reservation was successful.
Reservation failed.
Reservation...
Membership card:
Pickup location: