Noncrossing Longest Paths and Cycles Noncrossing Longest Paths and Cycles

Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short geometric structures such as shortest perfect matchings, shortest spanning trees, shortest spanning paths, and shortest...

Celý popis

Podrobná bibliografie

Vydáno v:	Graphs and combinatorics Ročník 41; číslo 6; s. 122
Hlavní autoři:	Aloupis, Greg, Biniaz, Ahmad, Bose, Prosenjit, De Carufel, Jean-Lou, Eppstein, David, Maheshwari, Anil, Odak, Saeed, Smid, Michiel, Tóth, Csaba D., Valtr, Pavel
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Tokyo Springer Japan 01.12.2025 Springer Nature B.V
Témata:	Combinatorial analysis Combinatorics Engineering Design Graph theory Graphs Inequality Mathematics Mathematics and Statistics Motion planning Original Paper Questions
ISSN:	0911-0119, 1435-5914
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!