Results 271 to 280 of about 27,053 (309)
Radiometric and spectral characterization of multipanel planar light-emitting devices: a generalizable irradiance mapping approach for dose estimation. [PDF]
J Biomed OptGerelli E, Wagnières G, Joniová J.
europepmc +1 more source
Machine Learning the Decoherence Property of Superconducting and Semiconductor Quantum Devices from Graph Connectivity. [PDF]
Entropy (Basel)Fu Q, Liu J, Wang X, Xiong R.
europepmc +1 more source
The fos homolog kayak is required for adult eye formation and function in Drosophila. [PDF]
Front NeurosciZúniga-García M, Riesgo-Escovar JR.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Fuzzy Systems, 2015
Fuzzy planar graph is a very important subclass of fuzzy graph. In this paper, two types of edges are mentioned for fuzzy graphs: effective edges and considerable edges. In addition, a comparative study between Kuratowski's graphs and fuzzy planar graph is made. A new concept of a strong fuzzy planar graph is introduced.
Sovan Samanta, Madhumangal Pal
exaly +2 more sources
Fuzzy planar graph is a very important subclass of fuzzy graph. In this paper, two types of edges are mentioned for fuzzy graphs: effective edges and considerable edges. In addition, a comparative study between Kuratowski's graphs and fuzzy planar graph is made. A new concept of a strong fuzzy planar graph is introduced.
Sovan Samanta, Madhumangal Pal
exaly +2 more sources
Planarity and Hyperbolicity in Graphs
Graphs and Combinatorics, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Walter Carballosa +3 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 ...
Thang Nguyen Bui, Andrew Peck
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 ...
Thang Nguyen Bui, Andrew Peck
openaire +2 more sources
Representations of Planar Graphs
SIAM Journal on Discrete Mathematics, 1993Summary: This paper shows that every 3-connected planar graph \(G\) can be represented as a collection of circles, one circle representing each vertex and each face, so that, for each edge of \(G\), the four circles representing the two endpoints and the two neighboring faces meet at a point, and furthermore the vertex-circles cross the face-circles at
Graham R. Brightwell +1 more
openaire +1 more source
Algorithmica, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Till Bruckdorfer +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Till Bruckdorfer +2 more
openaire +1 more source
Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Euler, Reinhardt, Zamfirescu, Tudor
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Euler, Reinhardt, Zamfirescu, Tudor
openaire +3 more sources