Connectivity of Planar Graphs
Copyright policy )Connectivity of Planar Graphs
We give here three simple linear time algorithms on planar graphs: a 4-connexity test for maximal planar graphs, an algorithm enumerating the triangles and a 3-connexity test. Although all these problems got already linear-time solutions, the presented algorithms are both simple and efficient. They are based on some new theoretical results.
[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Connectivity, graph connectiveness, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, graph theory, linear-time algorithms, connectiveness, planar graphs, orientation
[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Connectivity, graph connectiveness, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, graph theory, linear-time algorithms, connectiveness, planar graphs, orientation
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!