Talk:Linkless embedding

This article is rated B-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Computer science

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

??? This article has not yet received a rating on the project's importance scale.

This article has been automatically rated by a bot or other tool because one or more other projects use this class. Please ensure the assessment is correct before removing the |auto= parameter.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Mathematics Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Low	This article has been rated as Low-priority on the project's priority scale.

modulo 2 in the definition of linking number?

I am confused by the definition here, carried over from an article of Robertson, Seymour and Thomas:

"The version of the linking number used for defining linkless embeddings of graphs is found by projecting the embedding onto the plane and counting the number of crossings of the projected embedding in which the first curve passes over the second one, modulo 2".

In an example from the page about the linking number (https://en.wikipedia.org/wiki/Linking_number#Definition), the first example from the left has linking number -2. But by the above definition, the blue curve passes over the red one two times, so the linking number is zero. Is mod 2 a mistake here? — Preceding unsigned comment added by 158.129.140.71 (talk) 08:15, 18 January 2016 (UTC)[reply]

Unclear sentence...

English is not may native language, and for me sentence Although linkless and flat embeddings are not the same, the graphs that have linkless embeddings turn out to be the same as the graphs that have flat embeddings is unclear, perhaps because of idiomatic expression turn out to be, that hard to tramslate in Russian. May you explain it in another words? Jumpow (talk) 21:59, 1 April 2016 (UTC)[reply]

Replacing "turn out to be" with "are" preserves the meaning and is simpler. —David Eppstein (talk) 22:39, 1 April 2016 (UTC)[reply]

Thank you. Now I understood sentence. Jumpow (talk) 15:34, 2 April 2016 (UTC)[reply]

External links modified

Hello fellow Wikipedians,

I have just modified one external link on Linkless embedding. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

Added archive https://web.archive.org/web/20110718171201/http://dspace.dml.cz/handle/10338.dmlcz/106404 to http://dspace.dml.cz/handle/10338.dmlcz/106404

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 13:29, 15 December 2017 (UTC)[reply]

linear time construction of linkless embedding

Does anyone have Kawarabayashi, Kreutzer & Mohar (2010)? From the abstract it seems to be about O(n^2) time for constructing a flat embedding, not in linear time as it appears in the text. SyP (talk) 14:32, 26 December 2018 (UTC)[reply]

It appears to be freely available online at http://logic.las.tu-berlin.de/Members/Kreutzer/Publications/12-dcg.pdf and it does indeed appear to be O(n^2) not O(n). —David Eppstein (talk) 17:52, 26 December 2018 (UTC)[reply]