Characterising Bounded Expansion by Neighbourhood Complexity

European Journal of Combinatorics - United States
doi 10.1016/j.ejc.2018.08.001
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Testing Expansion in Bounded-Degree Graphs

2007English

Time-Bounded Kolmogorov Complexity and Solovay Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Functions of Bounded Expansion: Normal and Bloch Functions

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1999English

Electric Transmission Network Expansion Planning With the Metaheuristic Variable Neighbourhood Search

2020English

Avoiding Abelian Powers in Binary Words With Bounded Abelian Complexity

International Journal of Foundations of Computer Science
Computer Science
2011English

Characterising the Effect of Propofol on Complexity and Stability in the EEG Power Spectrum

British Journal of Anaesthesia
AnesthesiologyPain Medicine
2018English

On Hahn Polynomial Expansion of a Continuous Function of Bounded Variation

PAMM
2016English

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Fine-Grained Complexity of Graph Homomorphism Problem for Bounded-Treewidth Graphs

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy