A locally connected spanning tree (LCST) T of a graph G is a spanning tree of G such that for each node its neighborhood in T induces a connected subgraph in G. The problem of determining whether a graph contains an LCST or not has been proved to be NP-complete, even if the graph is planar or chordal. The main result of this paper is a linear time algorithm that, given an SC 3-tree (i.e. a maxi...

K. THULASIRAMAN, R. JAYAKUMAR, at X can be rearranged such that all the descendant pertinent AND M. N. S. SWAMY leaves of X appear consecutively at either the left or the right end of the frontier, with at least one nonpertinent leaf appearing at Absrruct--In this paper, we first point out that the planarization althe other end of the frontier. gorithm due to Ozawa and Takabashi [4] does not in...

We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with nice convex drawings: outer k-planar graphs, where each edge is crossed by at most k other edges; and, outer k-quasi-planar graphs where no k edges can mutually cross. We show that the outer k-planar graphs are (b √ 4k + 1...

Optimal algorithms for computing the minimum distance between two finite planar sets, " Proc. A fast algorithm for the planar convex hull problem, " internal manuscript, [25] B. K. Bhattacharya and G. T. Toussaint. " A time-and-storage efficient implementation of an optimal planar convex hull algorithm, " Divide and conquer for linear expected time, " Inform. A linear algorithm for finding the ...

Data derived from digital computer analysis of three corrected lead recordings for each of 13 term, normal newborn infants obtained on the first day of life are reported. The Frank, Schmitt SVEC-III, and McFee axial systems recorded the time sequence of ventricular depolarization force orientation in an almost identical manner. The following electrocardiographic measurements are reported for ea...

We present a data structure that can maintain a simple planar graph under edge contractions in linear total time. The data structure supports adjacency queries and provides access to neighbor lists in O(1) time. Moreover, it can report all the arising self-loops and parallel edges. By applying the data structure, we can achieve optimal running times for decremental bridge detection, 2-edge conn...

A bar 1-visibility drawing of a graph G is a drawing of G where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the horizontal line segments representing the end vertices and a vertical line segment corresponding to an edge intersects at most one bar which is not an en...

A Hamiltonian cycle (path) of a graph G is a simple cycle (path) which contains all the vertices of G. The Hamiltonian cycle problem asks whether a given graph contains a Hamiltonian cycle. It is NP-complete even for 3-connected planar graphs [3, 61. However, the problem becomes polynomial-time solvable for Cconnected planar graphs: Tutte proved that such a graph necessarily contains a Hamilton...

The imaging sequences used in first pass (FP) perfusion to date have important limitations in contrast-to-noise ratio (CNR), temporal and spatial resolution, and myocardial coverage. As a result, controversy exists about optimal imaging strategies for FP myocardial perfusion. Since imaging performance varies from subject to subject, it is difficult to form conclusions without direct comparison ...

For a graph G , we define the lower bipartite number LB( ) as minimum order of maximal induced subgraph . We study parameter, and related parameter domination, providing bounds both in general graphs some families. example, show that there are arbitrarily large 4-connected planar with = 4 but 5-connected has linear ). also if is outerplanar n then lies between ( + 2)/3 2 /3, these sharp.