Results 241 to 250 of about 2,151,737 (304)
Some of the next articles are maybe not open access.
I/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering
IEEE Transactions on Knowledge and Data Engineering, 2019Core decomposition is a fundamental graph problem with a large number of applications. Most existing approaches for core decomposition assume that the graph is kept in memory of a machine.
Lu Qin, Dong Wen
exaly +2 more sources
2014 IEEE Fourth International Conference on Big Data and Cloud Computing, 2014
In this paper, we propose an efficient algorithm to decompose a directed acyclic graph (DAG) G into a minimized set of node-disjoint chains, which cover all the nodes of G. For any two nodes u and v on a chain, if u is above v then there is a path from u to v in G. The best algorithm for this problem up to now needs O(n3) time, where n is the number of
Yangjun Chen, Yibin Chen
openaire +2 more sources
In this paper, we propose an efficient algorithm to decompose a directed acyclic graph (DAG) G into a minimized set of node-disjoint chains, which cover all the nodes of G. For any two nodes u and v on a chain, if u is above v then there is a path from u to v in G. The best algorithm for this problem up to now needs O(n3) time, where n is the number of
Yangjun Chen, Yibin Chen
openaire +2 more sources
IEEE transactions on intelligent transportation systems (Print), 2022
With the emerging connected-vehicle technologies and smart roadways, the need for intelligent adaptive traffic signal controls (ATSC) is more than ever before.
Shan Jiang +3 more
semanticscholar +1 more source
With the emerging connected-vehicle technologies and smart roadways, the need for intelligent adaptive traffic signal controls (ATSC) is more than ever before.
Shan Jiang +3 more
semanticscholar +1 more source
DeGNN: Improving Graph Neural Networks with Graph Decomposition
Knowledge Discovery and Data Mining, 2021Mining from graph-structured data is an integral component of graph data management. A recent trending technique, graph convolutional network (GCN), has gained momentum in the graph mining field, and plays an essential part in numerous graph-related ...
Xupeng Miao +19 more
semanticscholar +1 more source
Comprehensive Image Captioning via Scene Graph Decomposition
European Conference on Computer Vision, 2020We address the challenging problem of image captioning by revisiting the representation of image scene graph. At the core of our method lies the decomposition of a scene graph into a set of sub-graphs, with each sub-graph capturing a semantic component ...
Yiwu Zhong +4 more
semanticscholar +1 more source
The policy graph decomposition of multistage stochastic programming problems
Networks, 2020We propose the policy graph as a structured way of formulating a general class of multistage stochastic programming problems in a way that leads to a natural decomposition. We also propose an extension to the stochastic dual dynamic programming algorithm
Oscar Dowson
semanticscholar +1 more source
Cores matter? An analysis of graph decomposition effects on influence maximization problems
Web Science Conference, 2020Estimating the spreading potential of nodes in a social network is an important problem which finds application in a variety of different contexts, ranging from viral marketing to spread of viruses and rumor blocking.
A. Calio, Andrea Tagarelli, F. Bonchi
semanticscholar +1 more source
Graph Decomposition of Slim Graphs
Graphs and Combinatorics, 1999Let \(H\) be a fixed graph. An \(H\)-decomposition of an input graph \(G\) is a partition of the edge set of \(G\) such that each part forms a subgraph isomorphic to \(H\). This problem is known to be NP-complete as soon as \(H\) has a component with at least three edges. (This was conjectured by Holyer, and proved independently by \textit{D. Dor} and \
Yair Caro, Raphael Yuster
openaire +2 more sources
The Decomposition Dimension of Graphs
Graphs and Combinatorics, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gary Chartrand +3 more
openaire +2 more sources
Induced Decompositions of Graphs
Journal of Graph Theory, 2012AbstractWe consider those graphs G that admit decompositions into copies of a fixed graph F, each copy being an induced subgraph of G. We are interested in finding the extremal graphs with this property, that is, those graphs G on n vertices with the maximum possible number of edges. We discuss the cases where F is a complete equipartite graph, a cycle,
J. Adrian Bondy, Jayme Luiz Szwarcfiter
openaire +2 more sources