Exact Algorithm for the Maximum Induced Planar Subgraph Problem
, 2011 International audienceWe prove that in an n-vertex graph, an induced planar subgraph of maximum size can be found in time O(1.7347^n ). This is the first algorithm breaking the trivial 2^n n^{O(1)} bound of the brute-force search algorithm for the ...
Yngve Villanger +5 more
core +1 more source
A Sharp Threshold Phenomenon in String Graphs. [PDF]
Discrete Comput Geom, 2022 Tomon I.
europepmc +1 more source
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]
Discrete Comput Geom, 2023 Casel K +4 more
europepmc +1 more source
Laboratory earthquakes decipher control and stability of rupture speeds. [PDF]
Nat Commun, 2023 Dong P +4 more
europepmc +1 more source
Getting new algorithmic results by extending distance-hereditary graphs via split composition. [PDF]
PeerJ Comput Sci, 2021 Cicerone S, Di Stefano G.
europepmc +1 more source
Automated design of dynamic programming schemes for RNA folding with pseudoknots. [PDF]
Algorithms Mol Biol, 2023 Marchand B +4 more
europepmc +1 more source
Photonic passbands induced by optical fractal effect in Cantor dielectric multilayers. [PDF]
PLoS One, 2022 Liu J, Shen J, Zhao D, Zhang P.
europepmc +1 more source
Характеризация совершенных доминантно-покрывающих графов
, 1998 A graph is called perfect dominant-covering if the domination number equals to the total point-covering number for any induced subgraph.
Зверович, И. Э.
core
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Algorithmica, 2022 Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source
Connectivity Labeling in Faulty Colored Graphs. [PDF]
Distrib ComputPetruschka A, Sapir S, Tzalik E.
europepmc +1 more source