Results 71 to 80 of about 4,514 (260)
On proper and Helly circular-arc graphs [PDF]
, 2010 Un modelo arco-circular es un par M=(C,A) donde C es un círculo y A es una familia de arcos de C. Si ningún arco se encuentra contenido en otro arco entonces decimos que M es propio, mientras que si A satisface la propiedad de Helly entonces decimos que ...
Soulignac, Francisco Juan
core
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace [PDF]
, 2012 We present a logspace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where canonical means that isomorphic graphs receive identical models.
Kuhnert, Sebastian +5 more
core +1 more source
Polarization Dynamics in Ferroelectrics: Insights Enabled by Machine Learning Molecular Dynamics
Advanced Science, EarlyView.Machine learning molecular dynamics is presented as a route to capture polarization switching, domain wall kinetics, topological polar textures, and polar mechanical coupling beyond the limits of conventional atomistic methods. This Perspective surveys recent progress and identifies key methodological directions, including long‐range electrostatics ...
Dongyu Bai +3 more
wiley +1 more source
Algorithms for clique-independent sets on subclasses of circular-arc graphs [PDF]
, 2006 A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property.
Lin, Min Chih +8 more
core +1 more source
Advanced Electronic Materials, Volume 11, Issue 6, May 2025.A straightforward method is introduced to produce ion‐gel films with very low surface roughness by employing a solution‐shearing coating process. These ion‐gel films permit the growth of crystalline thin films of various small molecule organic semiconductor molecules directly on top of the ion‐gel layer, thereby enabling “inverted” small molecule ...
Jonathan Perez Andrade +10 more
wiley +1 more source
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
, 2010 An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
On some subclasses of circular-arc catch digraphs
, 2022 Catch digraphs was introduced by Hiroshi Maehara in 1984 as an analog of intersection graphs where a family of pointed sets represents a digraph. After that Prisner continued his research particularly on interval catch digraphs by characterizing them ...
Ghosh, Shamik +2 more
core
Advanced Electronic Materials, EarlyView.This paper reviews the physics of liquid metals in RF devices, including the influence of mechanical strain on resonance as well as fabrication methods and strategies for designing tunable and strain‐tolerant inductors, capacitors, and antennas.
Md Saifur Rahman, William J. Scheideler
wiley +1 more source
On the isomorphism problem for Helly circular-arc graphs
Information and Computation, 2016 22 pages, 5 figures.
Johannes Köbler +2 more
openaire +3 more sources
, 2005 The circular arc coloring problem is to find a minimum coloring of a set of arcs of a circle so that no two overlapping arcs share a color. This NP-hard problem arises in a rich variety of applications and has been studied extensively.
Hu, Z, Zang, W, Chen, X
core +1 more source