Pages that link to "Item:Q2445395"
From MaRDI portal
The following pages link to Maximum common induced subgraph parameterized by vertex cover (Q2445395):
Displaying 8 items.
- Streaming deletion problems parameterized by vertex cover (Q2140522) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- (Q5140773) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
