Cover Image

Three iterations of $(d-1)$-WL test distinguish non isometric clouds of $d$-dimensional points

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rose, Valentino Delle, Kozachinskiy, Alexander, Rojas, Cristóbal, Petrache, Mircea, Barceló, Pablo
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Discrete Mathematics 05C60, 68R12, 68R10 F.2.2; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A framework for distributed discrete evacuation strategies
by: Borowiecki, Piotr, et al.
Published: (2025)

Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)

Searching in trees with monotonic query times
by: Dereniowski, Dariusz, et al.
Published: (2024)

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

The Ultimate Signs of Second-Order Holonomic Sequences
by: Hagihara, Fugen, et al.
Published: (2025)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
by: Behera, Diptimaya, et al.
Published: (2025)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)

Some Counterexamples for Compatible Triangulations
by: Barnson, Cody, et al.
Published: (2016)

On the thinness of trees
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
by: Laekhanukit, Bundit
Published: (2024)

Folding One Polyhedral Metric Graph into Another
by: Chung, Lily, et al.
Published: (2024)

Local iterative algorithms for approximate symmetry guided by network centralities
by: Hartman, David, et al.
Published: (2025)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

Thick Forests
by: Dyer, Martin, et al.
Published: (2023)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
by: Wittwer, David, et al.
Published: (2024)

On the twin-width of near-regular graphs
by: Heinrich, Irene, et al.
Published: (2025)

Graphs whose vertices of degree at least 2 lie in a triangle
by: Forte, Vinicius L. do, et al.
Published: (2022)

Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach
by: Chimani, Markus, et al.
Published: (2024)

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs
by: Casteigts, Arnaud, et al.
Published: (2023)

Simple, strict, proper, happy: A study of reachability in temporal graphs
by: Casteigts, Arnaud, et al.
Published: (2022)

Diameter Constraints in 2-distance Graphs
by: Al-saadi, Oleksiy, et al.
Published: (2025)

On the spectra of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2025)

Some integer values in the spectra of burnt pancake graphs
by: Blanco, Saúl A., et al.
Published: (2024)

Continuous Flattening and Reversing of Convex Polyhedral Linkages
by: Demaine, Erik D., et al.
Published: (2024)

Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)

Determining Factorial Speed Fast
by: Feng, Zhidan, et al.
Published: (2026)

Optimized Degree Realization: Minimum Dominating Set & Maximum Matching
by: Bar-Noy, Amotz, et al.
Published: (2025)

Noisy group testing via spatial coupling
by: Coja-Oghlan, Amin, et al.
Published: (2024)

The Gallai Vertex Problem is $Θ_2^p$-Complete
by: Nikabadi, Amir, et al.
Published: (2026)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)