Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Simple Recognition of Halin Graphs and Their Generalizations

From MaRDI portal
Publication:5739846
Jump to:navigation, search

DOI10.7155/jgaa.00395zbMath1339.05385arXiv1502.05334OpenAlexW3105066740MaRDI QIDQ5739846

David Eppstein

Publication date: 5 July 2016

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

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


zbMATH Keywords

linear-time algorithmslinear time Halin graph recognition algorithms


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)


Related Items

Drawing Halin-graphs with small height ⋮ Treetopes and their graphs ⋮ The weighted barycenter drawing recognition problem ⋮ Intersections and circuits in sets of line segments


Uses Software

  • CirclePack
  • Python


Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5739846&oldid=30489277"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 March 2024, at 05:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki