Pages that link to "Item:Q716314"

The following pages link to Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314):

Displaying 30 items.

• Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
• Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
• Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
• Parameterized algorithms for the module motif problem (Q342716) (← links)
• Finding approximate and constrained motifs in graphs (Q390871) (← links)
• Constrained multilinear detection for faster functional motif discovery (Q456168) (← links)
• Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← 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)
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
• Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
• Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
• Partial information network queries (Q2018546) (← links)
• The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
• Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
• Algorithms for topology-free and alignment network queries (Q2250538) (← links)
• The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
• The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
• Improved parameterized algorithms for network query problems (Q2414861) (← links)
• Fixed-parameter algorithms for scaffold filling (Q2513609) (← links)
• Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
• Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
• Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
• Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
• Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
• (Q5140739) (← links)
• The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781) (← links)
• Tropical paths in vertex-colored graphs (Q5918388) (← links)
• The balanced connected subgraph problem (Q5918764) (← links)