Pages that link to "Item:Q419416"

The following pages link to Sparsity. Graphs, structures, and algorithms (Q419416):

Displaying 6 items.

• Complexity of token swapping and its variants (Q722547) (← links)
• Limits of schema mappings (Q1650918) (← links)
• Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
• Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603) (← links)
• The book thickness of 1-planar graphs is constant (Q2408921) (← links)
• Interpreting nowhere dense graph classes as a classical notion of model theory (Q2441640) (← links)