Generic algorithms for some decision problems on fasciagraphs and rotagraphs
DOI10.1016/J.DISC.2012.02.013zbMATH Open1245.05126OpenAlexW2033170802MaRDI QIDQ442402FDOQ442402
Authors: M. Bouznif, Myriam Preissmann, Julien Moncel 
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
Recommendations
- Algebraic approach to fasciagraphs and rotagraphs
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs
- scientific article; zbMATH DE number 1390094
- scientific article; zbMATH DE number 3845609
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cites Work
- Graphs, dioids and semirings. New models and algorithms.
- 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
- Generic algorithms for some decision problems on fasciagraphs and rotagraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
- Optimal locating-total dominating sets in strips of height 3
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs
- Generic algorithms for some decision problems on fasciagraphs and rotagraphs
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
This page was built for publication: Generic algorithms for some decision problems on fasciagraphs and rotagraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442402)
