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

scientific article

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

zbMath0800.68623MaRDI QIDQ3138901

Elias Dahlhaus, Mark B. Nivick, Marek Karpinski

Publication date: 2 January 1994


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimizationparallel algorithmsclique separator decompositionNC algorithm


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)


Related Items (4)

Minimal triangulations of graphs: a survey ⋮ An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph ⋮ An introduction to clique minimal separator decomposition ⋮ Revisiting Decomposition by Clique Separators




This page was built for publication:

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