Results 191 to 200 of about 6,506,964 (218)

TP-RotatE: A knowledge graph representation learning method combining path information and rules to capture complex relational patterns. [PDF]

PLoS One
Liu X, Shi Y, Xu Y, Ren Y.
europepmc   +1 more source

k-Clique counting on large scale-graphs: a survey. [PDF]

PeerJ Comput Sci
Çalmaz B, Ergenç Bostanoğlu B.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

SubFlow: A Dynamic Induced-Subgraph Strategy Toward Real-Time DNN Inference and Training

IEEE Real Time Technology and Applications Symposium, 2020
We introduce SubFlow-a dynamic adaptation and execution strategy for a deep neural network (DNN), which enables real-time DNN inference and training.
Seulki Lee, S. Nirjon
semanticscholar   +1 more source

Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters

International Conference on Principles of Distributed Systems, 2021
Subgraph detection has recently been one of the most studied problems in the CONGEST model of distributed computing. In this work, we study the distributed complexity of problems closely related to subgraph detection, mainly focusing on induced subgraph ...
Janne H. Korhonen, Amir Nikabadi
semanticscholar   +1 more source

Efficient Ising Model Mapping for Induced Subgraph Isomorphism Problems Using Ising Machines

2019 IEEE 9th International Conference on Consumer Electronics (ICCE-Berlin), 2019
Ising machines have attracted attention as they are expected to solve combinatorial optimization problems at high speed with Ising models corresponding to those problems.
Natsuhito Yoshimura, Masashi Tawada, Shu Tanaka, Junya Arai, Satoshi Yagi, Hiroyuki Uchiyama, N. Togawa   +6 more
semanticscholar   +1 more source

The Largest Subgraph Without A Forbidden Induced Subgraph

Combinatorica
We initiate the systematic study of the following Turán-type question. Suppose Γ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage ...
Jacob Fox, R. Nenadov, Huy Tuan Pham
semanticscholar   +1 more source

Advice Complexity of the Online Induced Subgraph Problem

International Symposium on Mathematical Foundations of Computer Science, 2015
Several well-studied graph problems aim to select a largest (or smallest) induced subgraph with a given property of the input graph. Examples of such problems include maximum independent set, maximum planar graph, and many others.
D. Komm, Rastislav Královič, Richard Královic, Christian Kudahl   +3 more
semanticscholar   +1 more source

Induced subgraph density. VI. Bounded VC-dimension

Advances in Mathematics, 2023
Tung H. Nguyen, Alex Scott, Paul Seymour
semanticscholar   +1 more source

Every graph occurs as an induced subgraph of some hypohamiltonian graph

Journal of Graph Theory, 2018
C. Zamfirescu, T. Zamfirescu
semanticscholar   +1 more source

Definability of Recursive Predicates in the Induced Subgraph Order

Indian Conference on Logic and Its Applications, 2017
R. Thinniyam
semanticscholar   +1 more source