Pages that link to "Item:Q1764807"
From MaRDI portal
The following pages link to Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807):
Displaying 10 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- An Experimental Study on Generating Planar Graphs (Q3004691) (← links)
- Computing Bond Types in Molecule Graphs (Q5323078) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
