Results 261 to 270 of about 2,372,931 (298)

Pityriasis amiantacea in erosive pustular dermatosis of the scalp: A report of three cases. [PDF]

SAGE Open Med Case Rep
Hladky V, Jasso-Olivares JC.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity

International/Italian Conference on Algorithms and Complexity, 2021
For intractable problems on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained complexity results.
Tatsuya Gima, T. Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Y. Otachi   +4 more
semanticscholar   +1 more source

On Colorful Vertex and Edge Cover Problems

Algorithmica, 2023
In this paper, we study two generalizations of Vertex Cover and Edge Cover , namely Colorful Vertex Cover and Colorful Edge Cover . In the Colorful Vertex Cover problem, given an n -vertex edge-colored graph G with colors from $$\{1, \ldots , \omega \}$$
Sayan Bandyapadhyay, Aritra Banik, S. Bhore   +2 more
semanticscholar   +1 more source

Optimal lower bounds for matching and vertex cover in dynamic graph streams

Cybersecurity and Cyberforensics Conference, 2020
In this paper, we give simple optimal lower bounds on the one-way two-party communication complexity of approximate Maximum Matching and Minimum Vertex Cover with deletions. In our model, Alice holds a set of edges and sends a single message to Bob.
J. Dark, C. Konrad
semanticscholar   +1 more source

Dismantling and Vertex Cover of Network Through Message Passing

IEEE Transactions on Circuits and Systems - II - Express Briefs, 2020
The dismantling problem and minimum vertex cover (MVC) problem of network are two fundamental NP-hard problems where the former aims to find a minimal subset of nodes whose removal leaves the network broken in small components of sub-extensive size and ...
Dawei Zhao, Shumian Yang, Xiaohui Han, Shuhui Zhang, Zhen Wang   +4 more
semanticscholar   +1 more source

Metric Dimension and Geodetic Set Parameterized by Vertex Cover

Symposium on Theoretical Aspects of Computer Science
For a graph $G$, a subset $S\subseteq V(G)$ is called a resolving set of $G$ if, for any two vertices $u,v\in V(G)$, there exists a vertex $w\in S$ such that $d(w,u)\neq d(w,v)$. The Metric Dimension problem takes as input a graph $G$ on $n$ vertices and
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, P. Tale   +6 more
semanticscholar   +1 more source

Potential Game Theoretic Learning for the Minimal Weighted Vertex Cover in Distributed Networking Systems

IEEE Transactions on Cybernetics, 2019
Toward the minimal weighted vertex cover (MWVC) in agent-based networking systems, this paper recasts it as a potential game and proposes a distributed learning algorithm based on relaxed greed and finite memory.
Changhao Sun, Wei Sun, Xiaochu Wang, Qingrui Zhou   +3 more
semanticscholar   +1 more source