On a directed tree problem motivated by a newly introduced graph product

DOI10.5614/EJGTA.2015.3.2.5zbMATH Open1467.68136OpenAlexW1913804228MaRDI QIDQ5006563FDOQ5006563

Authors: Antoon H. Boode, Jan F. Broenink, Hajo Broersma 

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2015.3.2.5

Recommendations

• Unsolved algorithmic problems on trees
• Complexity of tree homomorphisms
• On the complexity of an optimal routing tree problem
• scientific article; zbMATH DE number 3878376
• Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms

zbMATH Keywords

finite deterministic directed acyclic labelled multi-graphsperiodic real-time systemstarget treesvertex-removing synchronised graph product

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Graph theory
• Exponential polynomials
• Title not available (Why is that?)
• Handbook of product graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• New common ancestor problems in trees and directed acyclic graphs
• Decompositions of graphs based on a new graph product
• Note on decompositions based on the vertex-removing synchronised graph product

This page was built for publication: On a directed tree problem motivated by a newly introduced graph product

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006563)