Pages that link to "Item:Q533412"

The following pages link to Complexity issues in vertex-colored graph pattern matching (Q533412):

Displaying 17 items.

• Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
• Finding approximate and constrained motifs in graphs (Q390871) (← links)
• Constrained multilinear detection for faster functional motif discovery (Q456168) (← links)
• Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
• Searching and inferring colorful topological motifs in vertex-colored graphs (Q782751) (← links)
• Binary jumbled pattern matching on trees and tree-like structures (Q893318) (← links)
• Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
• Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
• The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (Q2220833) (← links)
• Algorithms for topology-free and alignment network queries (Q2250538) (← links)
• Some results on more flexible versions of Graph Motif (Q2354588) (← links)
• The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
• Fixed-parameter algorithms for scaffold filling (Q2513609) (← links)
• Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
• Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
• Algorithmic Aspects of the Maximum Colorful Arborescence Problem (Q2988823) (← links)
• Heuristic Algorithms for the Maximum Colorful Subtree Problem (Q5090364) (← links)