Image de couverture de livre

Reducing concept lattices by means of a weaker notion of congruence

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Aragón, Roberto G., Medina, Jesús, Ramírez-Poussa, Eloísa
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Impact of local congruences in variable selection from datasets
par: Aragón, Roberto G., et autres
Publié: (2024)

A new notion of commutativity for the algorithmic Lovász Local Lemma
par: Harris, David G., et autres
Publié: (2020)

Recursive lattice reduction -- A framework for finding short lattice vectors
par: Aggarwal, Divesh, et autres
Publié: (2023)

Local Search k-means++ with Foresight
par: Conrads, Theo, et autres
Publié: (2024)

Reducing Shortcut and Hopset Constructions to Shallow Graphs
par: Haeupler, Bernhard, et autres
Publié: (2025)

Preprocessing to Reduce the Search Space for Odd Cycle Transversal
par: Jansen, Bart M. P., et autres
Publié: (2024)

DAG Projections: Reducing Distance and Flow Problems to DAGs
par: Haeupler, Bernhard, et autres
Publié: (2026)

On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2025)

Fast $k$-means Seeding Under The Manifold Hypothesis
par: Shah, Poojan, et autres
Publié: (2026)

Undirected Replacement Paths: Dual Fault Reduces to Single Source
par: Nogler, Jakob, et autres
Publié: (2026)

A Simple PTAS for Weighted $k$-means and Sensor Coverage
par: Pareek, Akash, et autres
Publié: (2025)

Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
par: Donkers, Huib, et autres
Publié: (2021)

When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
par: Udwani, Rajan
Publié: (2023)

Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs
par: Kumar, Akash, et autres
Publié: (2026)

Independent subcontexts and blocks of concept lattices. Definitions and relationships to decompose fuzzy contexts
par: Aragón, Roberto G., et autres
Publié: (2026)

Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors
par: Sharma, Roohani, et autres
Publié: (2026)

Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts
par: Fischer, Nick, et autres
Publié: (2026)

Sublinear Random Access Generators for Preferential Attachment Graphs
par: Even, Guy, et autres
Publié: (2016)

PIPQ: Strict Insert-Optimized Concurrent Priority Queue
par: Grimes, Olivia, et autres
Publié: (2025)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
par: Yu, Kaiqiang, et autres
Publié: (2025)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
par: Hochbaum, Dorit S., et autres
Publié: (2025)

Variations on the Problem of Identifying Spectrum-Preserving String Sets
par: Chakraborty, Sankardeep, et autres
Publié: (2026)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
par: Adamson, Duncan, et autres
Publié: (2025)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
par: Conte, Alessio, et autres
Publié: (2024)

A Faster $k$-means++ Algorithm
par: Liang, Jiehao, et autres
Publié: (2022)

Computing finite index congruences of finitely presented semigroups and monoids
par: Anagnostopoulou-Merkouri, Marina, et autres
Publié: (2023)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
par: Harris, David G.
Publié: (2021)

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
par: Harris, David G.
Publié: (2023)

Range-Based Set Reconciliation via Range-Summarizable Order-Statistics Stores
par: Amparore, Elvio G.
Publié: (2026)

QuaRs: A Transform for Better Lossless Compression of Integers
par: Matt, Jonas G.
Publié: (2025)

Deterministic Dynamic Edge Colouring
par: Christiansen, Aleksander B. G.
Publié: (2024)

Efficient Algorithms for Earliest and Fastest Paths in Public Transport Networks
par: Srikanth, Mithinti, et autres
Publié: (2024)

Parameterized Linear Time Transitive Closure
par: Kritikakis, Giorgos, et autres
Publié: (2024)

Improved parallel derandomization via finite automata with applications
par: Giliberti, Jeff, et autres
Publié: (2024)

Exploration of Always $S$-Connected Temporal Graphs
par: Adamson, Duncan, et autres
Publié: (2026)

Simple and efficient four-cycle counting on sparse graphs
par: Burkhardt, Paul, et autres
Publié: (2023)

How to Reduce Temporal Cliques to Find Sparse Spanners
par: Angrick, Sebastian, et autres
Publié: (2024)

Cycle Basis Algorithms for Reducing Maximum Edge Participation
par: Wang, Fan, et autres
Publié: (2025)

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
par: Tan, Jingjing
Publié: (2024)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
par: Hwang, Samuel, et autres
Publié: (2024)