Drawing Graphs Using Modular Decomposition

Lecture Notes in Computer Science - Germany
doi 10.1007/11618058_31
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Dynamic Distance Hereditary Graphs Using Split Decomposition

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Drawing Graphs on a Smartphone

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Survey on Planar Drawing of Clustered Graphs

IOSR Journal of Computer Engineering
2013English

Are Crossings Important for Drawing Large Graphs?

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Drawing Clustered Graphs on an Orthogonal Grid

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Modular Strategies for Recursive Game Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Sublogarithmic Distributed MIS Algorithm for Sparse Graphs Using Nash-Williams Decomposition

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2009English

Path Decomposition Number of Certain Graphs

Open Journal of Discrete Applied Mathematics
2018English

Eigensharp Graphs: Decomposition Into Complete Bipartite Subgraphs

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy