Pages that link to "Item:Q834895"
From MaRDI portal
The following pages link to Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895):
Displaying 10 items.
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
- Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints (Q2108178) (← links)
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
- Finding Largest Common Substructures of Molecules in Quadratic Time (Q2971143) (← links)
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718) (← links)
- Largest Weight Common Subtree Embeddings with Distance Penalties (Q5005156) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
