Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Clustered_planarity> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Clustered_planarity abstract "In graph drawing, a clustered planar graph is a graph together with a hierarchical clustering on its vertices, such that the graph drawn together with a collection of simple closed curves surrounding each cluster, so that there are no crossings between graph edges or clusters.The clustering can be described combinatorially by a collection of subsets of the vertices such that, for each two subsets, either both are disjoint or one is contained in the other. It is not required that the clustering be maximal nor that every vertex belong to a cluster.In a clustered planar drawing, no two edges may cross each other (that is, the graph must be planar), no two of the curves representing clusters may cross each other, an edge may cross a cluster boundary only if it connects a vertex inside the cluster to a vertex outside the cluster, and when an edge and cluster boundary cross they may cross only once. It is unknown whether it is possible to construct clustered planar drawings in polynomial time. However, many special cases have polynomial time algorithms.".
- Clustered_planarity thumbnail Clustered_planar.svg?width=300.
- Clustered_planarity wikiPageID "44034633".
- Clustered_planarity wikiPageLength "6665".
- Clustered_planarity wikiPageOutDegree "9".
- Clustered_planarity wikiPageRevisionID "681061712".
- Clustered_planarity wikiPageWikiLink Category:Graph_drawing.
- Clustered_planarity wikiPageWikiLink Graph_drawing.
- Clustered_planarity wikiPageWikiLink Graph_rewriting.
- Clustered_planarity wikiPageWikiLink Hierarchical_clustering.
- Clustered_planarity wikiPageWikiLink Jordan_curve_theorem.
- Clustered_planarity wikiPageWikiLink PQ_tree.
- Clustered_planarity wikiPageWikiLink Planar_graph.
- Clustered_planarity wikiPageWikiLink Polynomial_time.
- Clustered_planarity wikiPageWikiLink Simple_closed_curve.
- Clustered_planarity wikiPageWikiLink Time_complexity.
- Clustered_planarity wikiPageWikiLink File:Clustered_planar.svg.
- Clustered_planarity wikiPageWikiLinkText "clustered planarity".
- Clustered_planarity hasPhotoCollection Clustered_planarity.
- Clustered_planarity wikiPageUsesTemplate Template:Harvtxt.
- Clustered_planarity wikiPageUsesTemplate Template:Reflist.
- Clustered_planarity subject Category:Graph_drawing.
- Clustered_planarity hypernym Graph.
- Clustered_planarity type Software.
- Clustered_planarity comment "In graph drawing, a clustered planar graph is a graph together with a hierarchical clustering on its vertices, such that the graph drawn together with a collection of simple closed curves surrounding each cluster, so that there are no crossings between graph edges or clusters.The clustering can be described combinatorially by a collection of subsets of the vertices such that, for each two subsets, either both are disjoint or one is contained in the other.".
- Clustered_planarity label "Clustered planarity".
- Clustered_planarity sameAs m.0121lwlv.
- Clustered_planarity sameAs Q18206054.
- Clustered_planarity sameAs Q18206054.
- Clustered_planarity wasDerivedFrom Clustered_planarity?oldid=681061712.
- Clustered_planarity depiction Clustered_planar.svg.
- Clustered_planarity isPrimaryTopicOf Clustered_planarity.