A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs

DOI10.1016/j.dam.2016.03.009zbMath1337.05098OpenAlexW2342558999MaRDI QIDQ284833

Myriam Preissmann, Marwane Bouznif, Julien Moncel

Publication date: 18 May 2016

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.03.009

zbMATH Keywords

gridscombinatorial optimization problemsconstant-time algorithm\(\min\)-plus algebrafasciagraphsrotagraphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locating-total domination in graphs
• Generic algorithms for some decision problems on fasciagraphs and rotagraphs
• Roman domination number of the Cartesian products of paths and cycles
• Computing the domination number of grid graphs
• 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
• Matrix period in max-algebra
• \(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.
• Generalized matrix period in max-plus algebra
• Easy problems for tree-decomposable graphs

This page was built for publication: A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs