Pages that link to "Item:Q4285634"
From MaRDI portal
The following pages link to An algebraic theory of graph reduction (Q4285634):
Displaying 41 items.
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- On \(\tau\)-adic representations of integers (Q1008948) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- Improving spanning trees by upgrading nodes (Q1960523) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- Parallel algorithms with optimal speedup for bounded treewidth (Q4645184) (← links)
- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295) (← links)
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width (Q4882496) (← links)
- (Q5005163) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- A parallel algorithm for edge-coloring partial k-trees (Q5054775) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
- (Q5089180) (← links)
- Decomposability helps for deciding logics of knowledge and belief (Q5096273) (← links)
- (Q5111293) (← links)
- (Q5111875) (← links)
- A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES (Q5248998) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)
- Monoidal Width: Capturing Rank Width (Q6150162) (← links)
- Finding edge-disjoint paths in partial k-trees (Q6487440) (← links)