About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Recent

Boolean: (bicycle AND helmet) OR (head AND protection) (always group AND in parenthesis)
Title: title:(climate change)
Author: author:("bohr niels" OR "bohr n") (avoid only full first name)
Phrase: "water pump control" (does not work with wildcards)
Wildcards: wom?n pharm*

More help on how to search

Flexible matching

About search syntax

Search syntax Advanced
Close advanced
{{problem}}
By field Using AND/OR By author
This tool can help you build boolean queries suitable for doing a broad search for different synonyms or spellings of each word. Start via the drop-down below or just start typing in the search field.
{{ row.typeTitle }}: ( )

Since our index often lack the full first name of people it can be difficult to correctly search by author.

Fill in the fields and let us help you build a good query:

If you need to find everything possible, consider only searching by last name.

Use "Starting year" to ignore publications out of year range.

Author: Alstrup remove
Filter results...

Interpreted as:

title:(A AND hamiltonian AND cycle AND in AND the AND square AND of AND a AND 2-connected AND graph AND in AND linear AND time)

Suggestions: Include records that partially match the query

Filter results
Access
Type
Language
Year
From DTU
Advanced
Previous 1 - 2 of 2 Next
Export
10 items by relevance
1 Conference paper

A hamiltonian cycle in the square of a 2-connected graph in linear time

Alstrup, Stephen; Georgakopoulos, Agelos; Rotenberg, Eva; Thomassen, Carsten

Proceedings of the Twenty-ninth Annual Acm-siam Symposium on Discrete Algorithms — 2018, pp. 1645-1649

Fleischner's theorem says that the square of every 2-connected graph contains a Hamiltonian cycle. We present a proof resulting in an O(|E|) algorithm for producing a Hamiltonian cycle in the square G2 of a 2-connected graph G = (V, E). The previous best was O(|V|2) by Lau in 1980. More generally

Year: 2018

Language: English

More...
bkjn mpe gilah ocfd
2 Conference paper

A hamiltonian cycle in the square of a 2-connected graph in linear time

Alstrup, Stephen; Georgakopoulos, Agelos; Rotenberg, Eva; Thomassen, Carsten

Proceedings of the Twenty-ninth Annual Acm-siam Symposium on Discrete Algorithms — 2018, pp. 1645-1649

Fleischner's theorem says that the square of every 2-connected graph contains a Hamiltonian cycle. We present a proof resulting in an O(|E|) algorithm for producing a Hamiltonian cycle in the square G2 of a 2-connected graph G = (V, E). The previous best was O(|V|2) by Lau in 1980. More generally

Year: 2018

Language: English

More...
p dgekhmfbjalinoc

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user