Amanote Research
Register
Sign In
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree
doi 10.1109/lics.2013.11
Full Text
Open PDF
Abstract
Available in
full text
Date
June 1, 2013
Authors
Lucas Heimberg
Dietrich Kuske
Nicole Schweikardt
Publisher
IEEE
Related search
Preservation and Decomposition Theorems for Bounded Degree Structures
Logical Methods in Computer Science
Computer Science
Theoretical Computer Science
Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks
Mobile Networks and Applications
Information Systems
Computer Networks
Hardware
Communications
Architecture
Software
An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs
Distributed Computing
Computer Networks
Hardware
Communications
Architecture
Computational Theory
Mathematics
Theoretical Computer Science
Countermodel Construction via Optimal Hypersequent Calculi for Non-Normal Modal Logics
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Sparse Universal Graphs for Bounded-Degree Graphs
Random Structures and Algorithms
Mathematics
Applied Mathematics
Computer Graphics
Computer-Aided Design
Software
Very Fast Construction of Bounded-Degree Spanning Graphs via the Semi-Random Graph Process
Ramsey Goodness of Bounded Degree Trees
Combinatorics Probability and Computing
Statistics
Probability
Applied Mathematics
Mathematics
Computational Theory
Theoretical Computer Science
Provably Bounded-Optimal Agents
Journal of Artificial Intelligence Research
Artificial Intelligence
Testing Expansion in Bounded-Degree Graphs
