Generic algorithms for some decision problems on fasciagraphs and rotagraphs

DOI10.1016/j.disc.2012.02.013zbMath1245.05126OpenAlexW2033170802MaRDI QIDQ442402

Julien Moncel, Myriam Preissmann, Marwane Bouznif

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.02.013

zbMATH Keywords

combinatorial optimizationgridsalgorithmic complexityNP-hard problemsfasciagraphsrotagraphs

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs ⋮ \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles ⋮ Generic algorithms for some decision problems on fasciagraphs and rotagraphs ⋮ Optimal locating-total dominating sets in strips of height 3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generic algorithms for some decision problems on fasciagraphs and rotagraphs
• Identifying codes in some subgraphs of the square lattice
• A generalization of the pentomino exclusion problem: dislocation of graphs
• Critical cyclic patterns related to the domination number of the torus
• Distance-related invariants on polygraphs
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• \(L(2,1)\)-labeling of direct product of paths and cycles
• Algebraic approach to fasciagraphs and rotagraphs
• Graphs, dioids and semirings. New models and algorithms.

This page was built for publication: Generic algorithms for some decision problems on fasciagraphs and rotagraphs