Sequence graphs: characterization and counting of admissible elements

DOI10.1007/978-3-030-63072-0_17zbMath1479.05231OpenAlexW3135595136MaRDI QIDQ2056908

Sammy Khalife

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-63072-0_17

zbMATH Keywords

polynomial time algorithmgraph representation

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• A strong-connectivity algorithm and its applications in data flow analysis
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Euclidean Distance Geometry and Applications