An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
Fuente:
arXiv
Guardado en:
| Autores principales: | Flores-Peñaloza, David, Lopez, Mario A., Marín, Nestaly, Orden, David |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
On the twin-width of near-regular graphs
por: Heinrich, Irene, et al.
Publicado: (2025)
por: Heinrich, Irene, et al.
Publicado: (2025)
Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
por: Gabryelski, Wojciech, et al.
Publicado: (2026)
por: Gabryelski, Wojciech, et al.
Publicado: (2026)
Adjacency Labeling Schemes for Small Classes
por: Bonnet, Édouard, et al.
Publicado: (2024)
por: Bonnet, Édouard, et al.
Publicado: (2024)
Backbone coloring for graphs with degree 4
por: Michalik, Krzysztof, et al.
Publicado: (2024)
por: Michalik, Krzysztof, et al.
Publicado: (2024)
Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
por: Zhang, Wenjing, et al.
Publicado: (2025)
por: Zhang, Wenjing, et al.
Publicado: (2025)
Adjacent vertex distinguishing total coloring of 3-degenerate graphs
por: Behera, Diptimaya, et al.
Publicado: (2025)
por: Behera, Diptimaya, et al.
Publicado: (2025)
On the Diameter of Arrangements of Topological Disks
por: Abiad, Aida, et al.
Publicado: (2025)
por: Abiad, Aida, et al.
Publicado: (2025)
Exploration of $k$-edge-deficient temporal graphs in linear time
por: Lahtin, Ivan, et al.
Publicado: (2026)
por: Lahtin, Ivan, et al.
Publicado: (2026)
A Note on the Subcubes of the $n$-Cube
por: Simon, Hans Ulrich
Publicado: (2024)
por: Simon, Hans Ulrich
Publicado: (2024)
Killing a Vortex
por: Thilikos, Dimitrios M., et al.
Publicado: (2022)
por: Thilikos, Dimitrios M., et al.
Publicado: (2022)
Optimal Bounds for the k-Disjoint Paths Problem
por: Cavallaro, Dario, et al.
Publicado: (2026)
por: Cavallaro, Dario, et al.
Publicado: (2026)
Benchmarking of algorithms for set partitions
por: Khinvasara, Arnav, et al.
Publicado: (2026)
por: Khinvasara, Arnav, et al.
Publicado: (2026)
Searching by Heterogeneous Agents
por: Dereniowski, Dariusz, et al.
Publicado: (2021)
por: Dereniowski, Dariusz, et al.
Publicado: (2021)
Quickly excluding an annotated planar graph
por: Gorsky, Maximilian, et al.
Publicado: (2026)
por: Gorsky, Maximilian, et al.
Publicado: (2026)
The price of homogeneity is polynomial
por: Gorsky, Maximilian, et al.
Publicado: (2026)
por: Gorsky, Maximilian, et al.
Publicado: (2026)
Independent Set Enumeration and Estimation of Related Constants of Grid Graphs and Their Variants
por: Liang, Kai
Publicado: (2025)
por: Liang, Kai
Publicado: (2025)
Polynomial Bounds for the Graph Minor Structure Theorem
por: Gorsky, Maximilian, et al.
Publicado: (2025)
por: Gorsky, Maximilian, et al.
Publicado: (2025)
On the spectra of prefix-reversal graphs
por: Blanco, Saúl A., et al.
Publicado: (2025)
por: Blanco, Saúl A., et al.
Publicado: (2025)
Some integer values in the spectra of burnt pancake graphs
por: Blanco, Saúl A., et al.
Publicado: (2024)
por: Blanco, Saúl A., et al.
Publicado: (2024)
Catching Rats in $H$-minor-free Graphs
por: Gorsky, Maximilian, et al.
Publicado: (2025)
por: Gorsky, Maximilian, et al.
Publicado: (2025)
A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
por: Rockel-Wolff, Benjamin
Publicado: (2024)
por: Rockel-Wolff, Benjamin
Publicado: (2024)
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
por: Choi, Mujin, et al.
Publicado: (2025)
por: Choi, Mujin, et al.
Publicado: (2025)
Metrics on Permutation Families Defined by a Restriction Graph
por: Tymoshenko, Danylo, et al.
Publicado: (2025)
por: Tymoshenko, Danylo, et al.
Publicado: (2025)
The Hierarchy of Saturating Matching Numbers
por: Simon, Hans U., et al.
Publicado: (2025)
por: Simon, Hans U., et al.
Publicado: (2025)
Topological Indices With Degree Sequence $\mathscr{D}$ of Tree
por: Hamoud, Jasem, et al.
Publicado: (2025)
por: Hamoud, Jasem, et al.
Publicado: (2025)
The partial gossip problem revisited
por: Kokhas, Konstantin, et al.
Publicado: (2026)
por: Kokhas, Konstantin, et al.
Publicado: (2026)
Novel Constructions of Words with Strong Avoidance Properties and their Combinatorial Analysis
por: Abdullah, Duaa, et al.
Publicado: (2025)
por: Abdullah, Duaa, et al.
Publicado: (2025)
Counting Kernels in Directed Graphs with Arbitrary Orientations
por: Jartoux, Bruno
Publicado: (2022)
por: Jartoux, Bruno
Publicado: (2022)
Independent Set Enumeration in King Graphs by Tensor Network Contractions
por: Liang, Kai
Publicado: (2025)
por: Liang, Kai
Publicado: (2025)
Completely independent spanning trees in the hypercube
por: Shaw, Benedict Randall
Publicado: (2024)
por: Shaw, Benedict Randall
Publicado: (2024)
Zero-free regions for the independence polynomial on restricted graph classes
por: Jerrum, Mark, et al.
Publicado: (2025)
por: Jerrum, Mark, et al.
Publicado: (2025)
Graphs whose vertices of degree at least 2 lie in a triangle
por: Forte, Vinicius L. do, et al.
Publicado: (2022)
por: Forte, Vinicius L. do, et al.
Publicado: (2022)
Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
por: Atherton, William, et al.
Publicado: (2024)
por: Atherton, William, et al.
Publicado: (2024)
Factorial Basis Method for q-Series Applications
por: Jiménez-Pastor, Antonio, et al.
Publicado: (2024)
por: Jiménez-Pastor, Antonio, et al.
Publicado: (2024)
Topological Indices Among Strong Support Vertex
por: Hamoud, Jasem, et al.
Publicado: (2025)
por: Hamoud, Jasem, et al.
Publicado: (2025)
On Topological Indices in Trees: Fibonacci Degree Sequences and Bounds
por: Hamoud, Jasem, et al.
Publicado: (2025)
por: Hamoud, Jasem, et al.
Publicado: (2025)
Degree Sequence of Albertson and $σ$-Indices on Trees of Order $n\geqslant 3$
por: Hamoud, Jasem, et al.
Publicado: (2025)
por: Hamoud, Jasem, et al.
Publicado: (2025)
Bounds on Trees with Topological Indices Among Degree Sequence
por: Hamoud, Jasem, et al.
Publicado: (2025)
por: Hamoud, Jasem, et al.
Publicado: (2025)
Homomorphism Counts to Trees
por: Dawar, Anuj
Publicado: (2024)
por: Dawar, Anuj
Publicado: (2024)
Greedy Sets and Greedy Numerical Semigroups
por: Pérez-Rosés, Hebert, et al.
Publicado: (2024)
por: Pérez-Rosés, Hebert, et al.
Publicado: (2024)
Ejemplares similares
-
On the twin-width of near-regular graphs
por: Heinrich, Irene, et al.
Publicado: (2025) -
Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
por: Gabryelski, Wojciech, et al.
Publicado: (2026) -
Adjacency Labeling Schemes for Small Classes
por: Bonnet, Édouard, et al.
Publicado: (2024) -
Backbone coloring for graphs with degree 4
por: Michalik, Krzysztof, et al.
Publicado: (2024) -
Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
por: Zhang, Wenjing, et al.
Publicado: (2025)