scientific article; zbMATH DE number 6273760

zbMath1283.68196arXiv1111.5357MaRDI QIDQ5403035

Hermann Gruber

Publication date: 25 March 2014

Full work available at URL: https://arxiv.org/abs/1111.5357

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

digraphvertex rankingregular expressionordered coloringstar heightcycle rank

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

An algorithmic metatheorem for directed treewidth ⋮ Bideterministic weighted automata ⋮ Bideterministic weighted automata ⋮ How to compute digraph width measures on directed co-graphs ⋮ A Slice Theoretic Approach for Embedding Problems on Digraphs ⋮ Structural properties of NFAs and growth rates of nondeterminism measures

This page was built for publication: