Three new heuristics for the Steiner problem in graphs.
Three-dimensional 1-bend graph drawings.
TimGA: A genetic algorithm for drawing undirected graphs.
Tournaments as feedback arc sets.
Traces of term-automatic graphs
In formal language theory, many families of languages are defined using either grammars or finite acceptors. For instance, context-sensitive languages are the languages generated by growing grammars, or equivalently those accepted by Turing machines whose work tape's size is proportional to that of their input. A few years ago, a new characterisation of context-sensitive languages as the sets of traces, or path labels, of rational graphs (infinite graphs defined by sets of finite-state...
Track layouts of graphs.
Traversing directed Eulerian mazes.
Treewidth and minimum fill-in on -trapezoid graphs.
Triangle-free planar graphs and segment intersection graphs.
Two linear time algorithms for MST on minor closed graph classes
This article presents two simple deterministic algorithms for finding the Minimum Spanning Tree in time for any non-trivial class of graphs closed on graph minors. This applies in particular to planar graphs and graphs of bounded genus. Both algorithms run on a pointer machine and they require no a priori knowledge of the structure of the class except for its density. Edge weights are only compared.