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; zbMATH DE number 1420907

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

zbMath0943.05078MaRDI QIDQ4944976

Anne Berry, Jean-Paul Bordat, Olivier Cogis

Publication date: 7 June 2000


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

zbMATH Keywords

minimal separatorsenumeration algorithm


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (10)

Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph ⋮ Graphs with polynomially many minimal separators ⋮ The \(k\)-hop connected dominating set problem: approximation and hardness ⋮ On the tractability of optimization problems on \(H\)-graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Solving Graph Problems via Potential Maximal Cliques ⋮ Efficiently enumerating minimal triangulations ⋮ Approximation of knapsack problems with conflict and forcing graphs ⋮ Unnamed Item






This page was built for publication:

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