Results 211 to 220 of about 17,262 (262)
Next-generation graph computing with electric current-based and quantum-inspired approaches. [PDF]
Nat CommunJang YH, Han J, Lee SH, Hwang CS.
europepmc +1 more source
Twisted 1- and 2-Azaperopyrenes: Synthesis, Structure, and Properties. [PDF]
ChemistryMolenda R +4 more
europepmc +1 more source
Harnessing Nanoporous Hexagonal Structures to Control the Coffee Ring Effect and Enhance Particle Patterning. [PDF]
MoleculesHan YJ +6 more
europepmc +1 more source
The bunkbed conjecture is false. [PDF]
Proc Natl Acad Sci U S AGladkov N, Pak I, Zimin A.
europepmc +1 more source
Autodesmotic reactions for general strain energy evaluation in polycyclic aromatic nanocarbons. [PDF]
Commun ChemWang Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Algorithmica, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruckdorfer, Till +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruckdorfer, Till +2 more
openaire +1 more source
SIAM Journal on Computing, 1992
The graph partitioning problem is the problem of dividing a given graph of \(n\) nodes into two sets of prescribed size while cutting a minimum number of edges. The authors show that the partitioning problem of a planar graph can be solved in polynomial time if the cutsize of the optimal partition is \(O(\log n)\) or if an embedding of the graph is ...
Bui, Thang Nguyen, Peck, Andrew
openaire +2 more sources
The graph partitioning problem is the problem of dividing a given graph of \(n\) nodes into two sets of prescribed size while cutting a minimum number of edges. The authors show that the partitioning problem of a planar graph can be solved in polynomial time if the cutsize of the optimal partition is \(O(\log n)\) or if an embedding of the graph is ...
Bui, Thang Nguyen, Peck, Andrew
openaire +2 more sources
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs
Algorithmica, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong, Seok-Hee, Eades, Peter
openaire +2 more sources
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs
Algorithmica, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong, Seok-Hee, Eades, Peter
openaire +1 more source
1998
Abstract A graph G is planar if it can be drawn in the plane or on the surface of a sphere so that no two edges meet, except at a vertex at which both are incident. Such a drawing partitions the set of points of the plane or sphere not lying on G into faces; for example, the following drawing has 6 faces.
Ronald C Read, Robin J Wilson
openaire +1 more source
Abstract A graph G is planar if it can be drawn in the plane or on the surface of a sphere so that no two edges meet, except at a vertex at which both are incident. Such a drawing partitions the set of points of the plane or sphere not lying on G into faces; for example, the following drawing has 6 faces.
Ronald C Read, Robin J Wilson
openaire +1 more source