scientific article; zbMATH DE number 3315017
From MaRDI portal
zbMath0197.50204MaRDI QIDQ5596083
Abraham Lempel, Shimon Even, Israel Cederbaum
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A linear algorithm for embedding planar graphs using PQ-trees, At most single-bend embeddings of cubic graphs, A unified approach to visibility representations of planar graphs, Rectilinear planar layouts and bipolar orientations of planar graphs, Finding small simple cycle separators for 2-connected planar graphs, The complexity of planarity testing, Planarity testing in parallel, A very personal reminiscence on the problem of computational complexity, Parallel ear decomposition search (EDS) and st-numbering in graphs, Criterion for a graph to admit a good orientation in terms of leaf blocks, Planarity Algorithms via PQ-Trees (Extended Abstract), Approximation algorithms for the maximum bounded connected bipartition problem, Graph graphics: Theory and practice, Drawing graphs on rectangular grids, The multi-tree approach to reliability in distributed networks, An efficient parallel algorithm for planarity, Property testing of planarity in the \textsf{CONGEST} model, A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid, Gap strings and spanning forests for bridge graphs of biconnected graphs, A generalized greedy routing algorithm for 2-connected graphs, A better heuristic for orthogonal graph drawings, Orthogonal drawing of high degree graphs with small area and few bends, Good acyclic orientations of 4‐regular 4‐connected graphs, Bijective counting of plane bipolar orientations, Bipolar orientations on planar maps and \(\mathrm{SLE}_{12}\), An improved algorithm for the red-blue hitting set problem with the consecutive ones property, Planarity for clustered graphs, A graphical calculus for semi-groupal categories, \(st\)-orientations with few transitive edges, PC trees and circular-ones arrangements., $st$-Orientations with Few Transitive Edges, Output-sensitive reporting of disjoint paths (extended abstract), An annotated review on graph drawing and its applications, On Representation of Planar Graphs by Segments, On the construction of planar embedding for a class of orthogonal polyhedra, Visibility representations of toroidal and Klein-bottle graphs, O(n2) algorithms for graph planarization, The minimum size of graphs satisfying cut conditions, Dynamic maintenance of planar digraphs, with applications, Compact visibility representation of 4-connected plane graphs, Enumerating the edge-colourings and total colourings of a regular graph, Bipartite graphs, upward drawings, and planarity, A new planarity test, st-ordering the vertices of biconnected graphs, Counting phylogenetic networks of level 1 and 2, Certifying algorithms, Orthogonal drawings of graphs for the automation of VLSI circuit design, Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs, On the thickness of graphs of given degree, A direct linear-time planarity test for unflippable modules, Area requirement and symmetry display of planar upward drawings, Constructing compact rectilinear planar layouts using canonical representation of planar graphs, Every plane graph is facially-non-repetitively \(C\)-choosable, Dynamic reachability in planar digraphs with one source and one sink, Algorithms for computing a parameterized \(st\)-orientation, Upward drawings of triconnected digraphs., Unnamed Item, Improved visibility representation of plane graphs, Closed rectangle-of-influence drawings for irreducible triangulations, NP-completeness of st-orientations for plane graphs, Balanced vertex-orderings of graphs, Computing an st-numbering, The topology of the coloring complex, Unnamed Item, Exploring the tiers of rooted phylogenetic network space using tail moves, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, A diameter-revealing proof of the Bondy-Lovász lemma, A dichotomy result for cyclic-order traversing games, Bijective counting of plane bipolar orientations and Schnyder woods, On Finding Directed Trees with Many Leaves, Almost envy-free allocations with connected bundles, Electrical networks and hyperplane arrangements, Visibility representation of plane graphs via canonical ordering tree, Bipolar orientations revisited, Combinatorial approximation algorithms for the maximum bounded connected bipartition problem, The minimum number of spanning trees in regular multigraphs, Reconstruction graphs and testing their properties in a relational spatial database, Finding the closed partition of a planar graph
