Pages that link to "Item:Q5897572"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5897572):
Displaying 13 items.
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Trimmed Moebius inversion and graphs of bounded degree (Q1959390) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (Q3130446) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach (Q3599157) (← links)
