685 research outputs found

    Layout of Graphs with Bounded Tree-Width

    Full text link
    A \emph{queue layout} of a graph consists of a total order of the vertices, and a partition of the edges into \emph{queues}, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its \emph{queue-number}. A \emph{three-dimensional (straight-line grid) drawing} of a graph represents the vertices by points in Z3\mathbb{Z}^3 and the edges by non-crossing line-segments. This paper contributes three main results: (1) It is proved that the minimum volume of a certain type of three-dimensional drawing of a graph GG is closely related to the queue-number of GG. In particular, if GG is an nn-vertex member of a proper minor-closed family of graphs (such as a planar graph), then GG has a O(1)×O(1)×O(n)O(1)\times O(1)\times O(n) drawing if and only if GG has O(1) queue-number. (2) It is proved that queue-number is bounded by tree-width, thus resolving an open problem due to Ganley and Heath (2001), and disproving a conjecture of Pemmaraju (1992). This result provides renewed hope for the positive resolution of a number of open problems in the theory of queue layouts. (3) It is proved that graphs of bounded tree-width have three-dimensional drawings with O(n) volume. This is the most general family of graphs known to admit three-dimensional drawings with O(n) volume. The proofs depend upon our results regarding \emph{track layouts} and \emph{tree-partitions} of graphs, which may be of independent interest.Comment: This is a revised version of a journal paper submitted in October 2002. This paper incorporates the following conference papers: (1) Dujmovic', Morin & Wood. Path-width and three-dimensional straight-line grid drawings of graphs (GD'02), LNCS 2528:42-53, Springer, 2002. (2) Wood. Queue layouts, tree-width, and three-dimensional graph drawing (FSTTCS'02), LNCS 2556:348--359, Springer, 2002. (3) Dujmovic' & Wood. Tree-partitions of kk-trees with applications in graph layout (WG '03), LNCS 2880:205-217, 200

    Planar projections of graphs

    Full text link
    We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on nn vertices has a representation in n/2+1\lceil \sqrt{n/2}+1 \rceil planes. In 3 dimensions, we show that there exist graphs with 6n156n-15 edges that can be projected onto two orthogonal planes, and that this is best possible. Finally, we obtain bounds in terms of parameters such as geometric thickness and linear arboricity. Using such a bound, we show that every graph of maximum degree 5 has a plane-projectable representation in 3 dimensions.Comment: Accepted at CALDAM 202

    Kappa free light chains is a valid tool in the diagnostics of MS: A large multicenter study

    Get PDF
    To validate kappa free light chain (KFLC) and lambda free light chain (LFLC) indices as a diagnostic biomarker in multiple sclerosis (MS).We performed a multicenter study including 745 patients from 18 centers (219 controls and 526 clinically isolated syndrome (CIS)/MS patients) with a known oligoclonal IgG band (OCB) status. KFLC and LFLC were measured in paired cerebrospinal fluid (CSF) and serum samples. Gaussian mixture modeling was used to define a cut-off for KFLC and LFLC indexes.The cut-off for the KFLC index was 6.6 (95% confidence interval (CI) = 5.2-138.1). The cut-off for the LFLC index was 6.9 (95% CI = 4.5-22.2). For CIS/MS patients, sensitivity of the KFLC index (0.88; 95% CI = 0.85-0.90) was higher than OCB (0.82; 95%CI = 0.79-0.85; p < 0.001), but specificity (0.83; 95% CI = 0.78-0.88) was lower (OCB = 0.92; 95% CI = 0.89-0.96; p < 0.001). Both sensitivity and specificity for the LFLC index were lower than OCB.Compared with OCB, the KFLC index is more sensitive but less specific for diagnosing CIS/MS. Lacking an elevated KFLC index is more powerful for excluding MS compared with OCB but the latter is more important for ruling in a diagnosis of CIS/MS
    corecore