Good Spanning Trees in Graph Drawing

Hossain, M. I., & Rahman, M. S. (2015). Good Spanning Trees in Graph Drawing. Theoretical Computer Science, 149-165.

Type

Journal article

Intellectual base

Primary research

Year

2015

DOI

10.1016/j.tcs.2015.09.004

Link

https://doi.org/10.1016/j.tcs.2015.09.004

Cited by

1 citation across 1 artifact.

Domain-specific

• Good Spanning Tree
  • The tree is good when no non-tree edge joins the endpoint vertex back to a strict ancestor on that path and when all remaining incident edges occur in three consecutive clockwise blocks: non-tree edges reaching left-side subtrees, tree edges to children, and non-tree edges reaching right-side subtrees.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:4750eb69fdb2 · see in the full table