Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

An output sensitive solution to the set union and intersection problem

From MaRDI portal
Publication:6560190
Jump to:navigation, search

DOI10.1007/BFB0037417zbMATH Open1541.68155MaRDI QIDQ6560190FDOQ6560190

Carlo Gaibisso, Guido Proietti, Enrico Nardelli

Publication date: 21 June 2024





zbMATH Keywords

set intersectionset union


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Nonnumerical algorithms (68W05)


Cites Work

  • A class of algorithms which require nonlinear time to maintain disjoint sets
  • Worst-case Analysis of Set Union Algorithms
  • On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem







This page was built for publication: An output sensitive solution to the set union and intersection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560190)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6560190&oldid=40093802"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 17:05. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki