Pages that link to "Item:Q5428821"
From MaRDI portal
The following pages link to Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (Q5428821):
Displayed 19 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Searching and inferring colorful topological motifs in vertex-colored graphs (Q782751) (← links)
- Finding and counting vertex-colored subtrees (Q1949738) (← links)
- Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- Some results on more flexible versions of Graph Motif (Q2354588) (← links)
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
- On Structural Parameterizations of Graph Motif and Chromatic Number (Q2971640) (← links)
- Finding Approximate and Constrained Motifs in Graphs (Q3011870) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)
- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940) (← links)
- Maximum Motif Problem in Vertex-Colored Graphs (Q3637115) (← links)
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle (Q5092506) (← links)
- A Survey on the Complexity of Flood-Filling Games (Q6163636) (← links)