Exact Algorithms for Graph Homomorphisms

Theory of Computing Systems- United States

doi 10.1007/s00224-007-2007-x

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Science and Business Media LLC

Related search

Graph Homomorphisms via Vector Colorings

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Finding Vertex-Surjective Graph Homomorphisms

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2012English

Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

New Algorithms for Exact Satisfiability

BRICS Report Series
2003English

Locally Constrained Graph Homomorphisms and Equitable Partitions

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2008English

Factor-Graph Algorithms for Equalization

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2007English

Exact Algorithms for Dominating Clique Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009Spanish

Exact Exponential-Time Algorithms for Finding Bicliques

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2010English

New Approximation Algorithms for Graph Coloring

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy