Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Computing and Combinatorics

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

DOI10.1007/11533719zbMath1128.05306OpenAlexW4376561447MaRDI QIDQ5716999

Endre Boros, Vladimir A. Gurvich, Khaled M. Elbassioni, Leonid G. Khachiyan

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11533719



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (8)

The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ Upper transversals in hypergraphs ⋮ Computational aspects of monotone dualization: a brief survey ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Simplicial models of trace spaces ⋮ Bounds on upper transversals in hypergraphs ⋮ Affine planes and transversals in 3-uniform linear hypergraphs ⋮ Unnamed Item




This page was built for publication: Computing and Combinatorics

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5716999&oldid=30466301"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 March 2024, at 04:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki