scientific article; zbMATH DE number 2086735
From MaRDI portal
Publication:4737278
zbMath1049.68099MaRDI QIDQ4737278
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2317/23170061.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Decidability of string graphs ⋮ Drawing interactive Euler diagrams from region connection calculus specifications ⋮ Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search ⋮ On the Completeness of Spider Diagrams Augmented with Constants ⋮ Can We “Show” the Correctness of Reasoning? On the Role of Diagrammatic Spatialization in Logical Justification ⋮ Neural ideals and stimulus space visualization ⋮ Automated theorem proving in Euler diagram systems ⋮ Efficient on-line algorithms for Euler diagram region computation ⋮ Subdivision Drawings of Hypergraphs ⋮ A graph theoretic approach to general Euler diagram drawing ⋮ Visual Mathematics: Diagrammatic Formalization and Proof ⋮ Generating Effective Euler Diagrams
This page was built for publication:
