scientific article

zbMATH Open0768.68170MaRDI QIDQ4028099FDOQ4028099

Jürgen Plehn, Bernd Voigt

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

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

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)

Cited In (17)

• Title not available (Why is that?)
• On the $AC^0$ Complexity of Subgraph Isomorphism
• On problems without polynomial kernels
• Parameterized complexity of reconfiguration of atoms
• Mining weighted subgraphs in a single large graph
• Grad and classes with bounded expansion. II: Algorithmic aspects
• On low tree-depth decompositions
• A parameterized view on matroid optimization problems
• Parameterized complexity of reconfiguration of atoms
• Finding and counting small tournaments in large tournaments
• Title not available (Why is that?)
• Parameterized Counting and Cayley Graph Expanders
• The challenges of unbounded treewidth in parameterised subgraph counting problems
• Algorithm engineering for color-coding with applications to signaling pathway detection
• A better subgraph of the minimum weight triangulation
• Are unique subgraphs not easier to find?
• LATIN 2004: Theoretical Informatics

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)