Clustering Cycles into Cycles of Clusters
From MaRDI portal
Publication:5301378
DOI10.7155/JGAA.00115zbMATH Open1161.68650OpenAlexW2051084693MaRDI QIDQ5301378FDOQ5301378
Authors: Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
Publication date: 19 January 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/55399
Recommendations
- Graph Drawing
- Clusters of cycles
- Cycle based clustering using reversible cellular automata
- Multicluster Interleaving on Paths and Cycles
- Clustering Using Cyclic Spaces of Reversible Cellular Automata
- Clustering
- Clustering to Given Connectivities
- scientific article; zbMATH DE number 5532145
- Clustering algorithm of graphs
- Finding cycles in hierarchical hypercube networks
Cited In (20)
- Clustering Using Cyclic Spaces of Reversible Cellular Automata
- Straight-line rectangular drawings of clustered graphs
- Clustered planarity = flat clustered planarity
- Crossing minimization in perturbed drawings
- Crossing minimization in perturbed drawings
- Relaxing the constraints of clustered planarity
- Multicluster Interleaving on Paths and Cycles
- Clustered Planarity: Clusters with Few Outgoing Edges
- Graph Drawing
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Towards the Hanani-Tutte theorem for clustered graphs
- Bounded Embeddings of Graphs in the Plane
- Cycle based clustering using reversible cellular automata
- Clustered planarity testing revisited
- Title not available (Why is that?)
- Clustered planarity with pipes
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- A new perspective on clustered planarity as a combinatorial embedding problem
- Advances on testing C-planarity of embedded flat clustered graphs
- Strip planarity testing for embedded planar graphs
This page was built for publication: Clustering Cycles into Cycles of Clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301378)