Results 181 to 190 of about 1,356,811 (224)
Task-constrained self-initiated attention shifts are indexed by frontal-midline theta ramping. [PDF]
Front Hum NeurosciHou D +4 more
europepmc +1 more source
Graph equations for line graphs and \(n\)-th power graphs. I
, 1978 Akiyama, J., Kaneko, K., Simic, S.
openaire +1 more source
A deep learning pipeline for mapping in situ network-level neurovascular coupling in multi-photon fluorescence microscopy. [PDF]
ElifeRozak MW +9 more
europepmc +1 more source
Generative Adversarial Networks for Energy-Aware IoT Intrusion Detection: Comprehensive Benchmark Analysis of GAN Architectures with Accuracy-per-Joule Evaluation. [PDF]
Sensors (Basel)Ioannou I, Vassiliou V.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2021
In this article, first we introduce six types of power graphs related to a graph (or directed graph), with the help of set theory.Then we show that these newly defined power graphs are pairwise distinct by a few examples. Finally, we discuss the relation between Eulerian being the base graph and these six power graph types.
Mokhtarian Dehkordi, Elham +3 more
openaire +1 more source
In this article, first we introduce six types of power graphs related to a graph (or directed graph), with the help of set theory.Then we show that these newly defined power graphs are pairwise distinct by a few examples. Finally, we discuss the relation between Eulerian being the base graph and these six power graph types.
Mokhtarian Dehkordi, Elham +3 more
openaire +1 more source
Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, 1984
In this paper we investigate a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition,
Dorit S. Hochbaum, David B. Shmoys
openaire +1 more source
In this paper we investigate a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition,
Dorit S. Hochbaum, David B. Shmoys
openaire +1 more source
Graphs whose powers are chordal and graphs whose powers are interval graphs
Journal of Graph Theory, 1997The main theorem of this paper gives a forbidden induced subgraph condition on \(G\) that is sufficient for chordality of \(G^m\). This theorem is a generalization of a theorem of Balakrishnan and Paulraja who had provided this only for \(m=2\).
openaire +2 more sources
Coloring Powers of Planar Graphs
SIAM Journal on Discrete Mathematics, 2003Summary: We give nontrivial bounds for the inductiveness or degeneracy of power graphs \(G^{k}\) of a planar graph \(G\). This implies bounds for the chromatic number as well, since the inductiveness naturally relates to a greedy algorithm for vertex-coloring the given graph.
Agnarsson, Geir +1 more
openaire +3 more sources
On the Power of Graph Searching for Cocomparability Graphs
SIAM Journal on Discrete Mathematics, 2016Summary: In this paper we study how graph searching on a cocomparability graph \(G\) can be used to produce cocomp orderings (i.e., orderings that are linear extensions of some transitive orientation of \(\overline{G}\)) that yield simple algorithms for various intractable problems in general.
Corneil, Derek G. +3 more
openaire +2 more sources