Pages that link to "Item:Q1949738"

The following pages link to Finding and counting vertex-colored subtrees (Q1949738):

Displaying 21 items.

• On finding rainbow and colorful paths (Q266284) (← 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)
• 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)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• Partial information network queries (Q2018546) (← links)
• The maximum binary tree problem (Q2041978) (← links)
• Algorithms for topology-free and alignment network queries (Q2250538) (← links)
• The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← 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)
• Improved parameterized algorithms for network query problems (Q2414861) (← links)
• Fixed-parameter algorithms for scaffold filling (Q2513609) (← links)
• Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
• Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
• (Q4993296) (← links)
• Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle (Q5092506) (← links)
• (Q5140739) (← links)
• On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)