scientific article
From MaRDI portal
Publication:4028099
zbMath0768.68170MaRDI QIDQ4028099
Publication date: 28 March 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Parameterized complexity of reconfiguration of atoms, On low tree-depth decompositions, The challenges of unbounded treewidth in parameterised subgraph counting problems, Grad and classes with bounded expansion. II: Algorithmic aspects, Parameterized Counting and Cayley Graph Expanders, Are unique subgraphs not easier to find?, Algorithm engineering for color-coding with applications to signaling pathway detection, On the $AC^0$ Complexity of Subgraph Isomorphism, Unnamed Item, On problems without polynomial kernels, A parameterized view on matroid optimization problems, Unnamed Item
