Exact Algorithms for Dominating Clique Problems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-10631-6_3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Edge Dominating Set: Efficient Enumeration-Based Exact Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Fixed Parameter Algorithms for Planar Dominating Set and Related Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Exact Algorithms for NP-Hard Problems: A Survey

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Exact Algorithms for Different Classes of Vehicle Routing Problems

4OR
MathematicsManagement ScienceManagement Information SystemsComputational TheoryOperations ResearchTheoretical Computer Science
2012English

The Power of Pivoting for Exact Clique Counting

2020English

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2011English

An Improved Bit Parallel Exact Maximum Clique Algorithm

Optimization Letters
ControlOptimization
2011English

Exact Algorithms for Graph Homomorphisms

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2007English

New Algorithms for Exact Satisfiability

BRICS Report Series
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy