Image de couverture de livre

Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Klost, Katharina, Mulzer, Wolfgang
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dynamic Connectivity in Disk Graphs
par: Baumann, Alexander, et autres
Publié: (2021)

Long Plane Trees
par: Cabello, Sergio, et autres
Publié: (2021)

Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
par: Gao, Jie, et autres
Publié: (2025)

Computing the Girth of a Segment Intersection Graph
par: Chan, Timothy M., et autres
Publié: (2026)

Computing Maximum Cliques in Unit Disk Graphs
par: Tkachenko, Anastasiia, et autres
Publié: (2025)

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
par: Koana, Tomohiro, et autres
Publié: (2024)

Maximum Matchings in Geometric Intersection Graphs
par: Bonnet, Édouard, et autres
Publié: (2019)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2024)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
par: An, Shinwoo, et autres
Publié: (2024)

Shortest Paths in Geodesic Unit-Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2026)

Subcoloring of (Unit) Disk Graphs
par: Marin, Malory, et autres
Publié: (2025)

Minimum Selective Subset on Unit Disk Graphs and Circle Graphs
par: Manna, Bubai
Publié: (2025)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
par: Chang, Hsien-Chih, et autres
Publié: (2024)

Minimum spanning blob-trees
par: Klost, Katharina, et autres
Publié: (2025)

Shortest Path Separators in Unit Disk Graphs
par: Harb, Elfarouk, et autres
Publié: (2024)

Improved Total Domination and Total Roman Domination in Unit Disk Graphs
par: Rout, Sasmita, et autres
Publié: (2024)

Optimally Covering Large Triangles with Homothetic Unit Triangles
par: Boyer, John M.
Publié: (2026)

Compatible Triangulations of Simple Polygons
par: Afshani, Peyman, et autres
Publié: (2026)

Drawings of Complete Multipartite Graphs Up to Triangle Flips
par: Aichholzer, Oswin, et autres
Publié: (2023)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
par: Chan, Timothy M., et autres
Publié: (2025)

Geometric Give and Take
par: Aichholzer, Oswin, et autres
Publié: (2026)

An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
par: de Berg, Mark, et autres
Publié: (2025)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2025)

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
par: Bose, Prosenjit, et autres
Publié: (2025)

Dynamic Unit-Disk Range Reporting
par: Wang, Haitao, et autres
Publié: (2024)

A Robust Approach to Detect Intersections between Triangles with Different Numerical Representations
par: Garau, Luca, et autres
Publié: (2025)

Computing Dominating Sets in Disk Graphs with Centers in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2026)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
par: Cabello, Sergio, et autres
Publié: (2021)

On the Line-Separable Unit-Disk Coverage and Related Problems
par: Liu, Gang, et autres
Publié: (2023)

(Semi-)Invariant Curves from Centers of Triangle Families
par: Mundilova, Klara, et autres
Publié: (2026)

On Line-Separable Weighted Unit-Disk Coverage and Related Problems
par: Liu, Gang, et autres
Publié: (2024)

Maximum Independent Sets in Disk Graphs with Disks in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2026)

On Triangles in Colored Pseudoline Arrangements
par: Radtke, Yan Alves, et autres
Publié: (2026)

The_5th_Triangle
par: Cave, Scott Allen
Publié: (2025)

Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
par: Duan, Hongyi, et autres
Publié: (2025)

An Interface Tracking Method with Triangle Edge Cuts
par: Wang, Mengdi, et autres
Publié: (2024)

Parameterized Geometric Graph Modification with Disk Scaling
par: Fomin, Fedor V., et autres
Publié: (2024)

Recognition of Unit Segment and Polyline Graphs is $\exists\mathbb{R}$-Complete
par: Hoffmann, Michael, et autres
Publié: (2024)

Differentiable Geodesic Distance for Intrinsic Minimization on Triangle Meshes
par: Li, Yue, et autres
Publié: (2024)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2025)