Results 101 to 110 of about 1,615,193 (298)
Journal of Graph Algorithms and ApplicationsSince Beineke's work in 1968 on linegraphs, attention has focused on the classification of graphs as linegraphs. It is known that every graph $G$ is the linegraph of an hypergraph, and the question is to characterize that root graph.
Dominique Barth +2 more
doaj +1 more source
On the Parameterized Complexity of Odd Coloring
Theoretical Computer ScienceAppeared in CALDAM ...
Sriram Bhyravarapu +2 more
openaire +4 more sources
Teaching Complexity and Its Practical Implications in Leadership Development Programs
, 2018 This article describes an advanced leadership seminar for senior managers and executives. The three module seminar describes how thoughtful leaders can learn to succeed even under conditions of extreme complexity. The first module describes complexity in
Hazy, James K
core +1 more source
Advanced Functional Materials, EarlyView.A thermodynamic model that incorporates ferroelectric, antiferroelectric, and antiferrodistortive orders of PbZrO3${\rm PbZrO}_3$ is established and parameterized based on experimental measurements and first‐principles calculations. We derive a Clapeyron‐like equation for describing the temperature‐dependence of critical electric fields for the ...
Zhiyang Wang +3 more
wiley +1 more source
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges
Journal of Graph Algorithms and ApplicationsOrienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an $st$-orientation orients each edge of the input
Carla Binucci +4 more
doaj +1 more source
Algorithms, 2013 We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing ...
Rolf Niedermeier +2 more
doaj +1 more source
Operando Tracking of Oxygen‐Vacancy Dynamics and Negative Capacitance in Ca‐Doped BiFeO3
Advanced Functional Materials, EarlyView.Operando electrochemical impedance spectroscopy, combined with electrocoloration, enables a direct correlation between real‐space ionic redistribution and the corresponding frequency‐domain electrical response. In lateral Ca‐doped BiFeO3 devices, time‐resolved impedance snapshots capture the evolution from bulk‐dominated mixed conduction to an ...
Jeonghun Suh +3 more
wiley +1 more source
Parameterized and approximation complexity of the detection pair problem in graphs
Journal of Graph Algorithms and Applications, 2017 We study the complexity of the problem ${\rm D{\small ETECTION}~P{\small AIR}}$. A detection pair of a graph $G$ is a pair $(W,L)$ of sets of detectors with $W\subseteq V(G)$, the watchers, and $L\subseteq V(G)$, the listeners, such that for every pair ...
Florent Foucaud, Ralf Klasing
doaj +1 more source
On the parameterized complexity of diverse SAT
Theoretical Computer Science27 pages, 5 figures; this is full version of the corresponding paper accepted and presented at the 35th International Symposium on Algorithms and Computation (ISAAC 2024)
Neeldhara Misra +2 more
openaire +5 more sources
Parameterized Valiant’s Classes [PDF]
, 2019 We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate reductions and ...
Bläser, Markus, Engels, Christian
core +1 more source