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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics Jg. 41; H. 6; S. 122
Hauptverfasser:	Aloupis, Greg, Biniaz, Ahmad, Bose, Prosenjit, De Carufel, Jean-Lou, Eppstein, David, Maheshwari, Anil, Odak, Saeed, Smid, Michiel, Tóth, Csaba D., Valtr, Pavel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Tokyo Springer Japan 01.12.2025 Springer Nature B.V
Schlagworte:	Combinatorial analysis Combinatorics Engineering Design Graph theory Graphs Inequality Mathematics Mathematics and Statistics Motion planning Original Paper Questions
ISSN:	0911-0119, 1435-5914
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!