scientific article; zbMATH DE number 1263176
From MaRDI portal
Publication:4234046
zbMath0978.68552MaRDI QIDQ4234046
Publication date: 29 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Complexity of computation (including implicit computational complexity) (03D15) Applications of graph theory to circuits and networks (94C15)
Related Items (7)
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs ⋮ The \(S\)-\textsc{labeling} problem: an algorithmic tour ⋮ D-SPECTRUM AND RELIABILITY OF A BINARY SYSTEM WITH TERNARY COMPONENTS ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Fast sequential importance sampling to estimate the graph reliability polynomial ⋮ Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time ⋮ Integrating and Sampling Cuts in Bounded Treewidth Graphs
This page was built for publication:
