scientific article
From MaRDI portal
Publication:3043788
zbMath1054.68583MaRDI QIDQ3043788
Lefteris Koutsofios, Stephen C. North, John Ellson, Gordon Woodhull, Emden R. Gansner
Publication date: 6 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2265/22650483.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (31)
Orthogonal layout with optimal face complexity ⋮ JGAP: a Java-based graph algorithms platform ⋮ On the heights of power digraphs modulo n ⋮ Drawing interactive Euler diagrams from region connection calculus specifications ⋮ Heuristics for the constrained incremental graph drawing problem ⋮ Learning theorem proving components ⋮ Summarization and visualization of multi-level and multi-dimensional itemsets ⋮ On the possible dimensions of subspace intersections ⋮ On possible dimensions of subspace intersections for five direct summands ⋮ Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search ⋮ A robust and informative method for solving large-scale power flow problems ⋮ Offline Drawing of Dynamic Trees: Algorithmics and Document Integration ⋮ A quality metric for visualization of clusters in graphs ⋮ Stress-Plus-X (SPX) graph layout ⋮ Revisited Experimental Comparison of Node-Link and Matrix Representations ⋮ Connection Scan Algorithm ⋮ Pathological and Test Cases for Reeb Analysis ⋮ Open-source machine learning: R meets Weka ⋮ Ant-based clustering for flow graph mining ⋮ Automata and cells in affine Weyl groups ⋮ A descriptive type foundation for RDF Schema ⋮ Symmetry of iteration graphs ⋮ Modeling rate of adaptive trait evolution using Cox-Ingersoll-Ross process: an approximate Bayesian computation approach ⋮ Graphviz ⋮ Classification of congruences of twisted partition monoids ⋮ Modular Parameter Identification of Biomolecular Networks ⋮ Unnamed Item ⋮ Evaluation of cyber security and modelling of risk propagation with Petri nets ⋮ Graph Drawing via Gradient Descent, $$(GD)^2$$ ⋮ New Quality Metrics for Dynamic Graph Drawing ⋮ The Turing Test for Graph Drawing Algorithms
Uses Software
This page was built for publication:
