scientific article; zbMATH DE number 139776

MaRDI QIDQ4028099zbMATH OpenFDO

Authors Jürgen Plehn, Bernd Voigt

Publication date 28 March 1993

zbMATH Keywords

algorithmtree-widthminimally weighted subgraphs

Mathematics Subject Classification ID

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

Recommendations

• Finding induced trees
• Finding, minimizing, and counting weighted subgraphs
• Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems
• Finding, minimizing, and counting weighted subgraphs
• Graph minors. II. Algorithmic aspects of tree-width

Cited in

(19)

• LATIN 2004: Theoretical Informatics
• Maximum weighted induced subgraphs
• On problems without polynomial kernels
• Boolean tensor decomposition for conjunctive queries with negation
• Parameterized complexity of reconfiguration of atoms
• On the \(\mathrm{AC}^0\) complexity of subgraph isomorphism
• On low tree-depth decompositions
• Grad and classes with bounded expansion. II: Algorithmic aspects
• Mining weighted subgraphs in a single large graph
• A parameterized view on matroid optimization problems
• Parameterized complexity of reconfiguration of atoms
• Finding and counting small tournaments in large tournaments
• scientific article; zbMATH DE number 6866317 (Why is no real title available?)
• The challenges of unbounded treewidth in parameterised subgraph counting problems
• Algorithm engineering for color-coding with applications to signaling pathway detection
• Parameterized Counting and Cayley Graph Expanders
• Finding induced trees
• Are unique subgraphs not easier to find?
• A better subgraph of the minimum weight triangulation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028099)