Results 41 to 50 of about 2,283,531 (215)
Graph Homomorphism Revisited for Graph Matching [PDF]
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
Capturing Topology in Graph Pattern Matching [PDF]
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source
GraphDuo: A Dual-Model Graph Processing Framework
Algorithms for large-scale natural graph processing can be categorized into two types based on their value propagation behaviors: the unidirectional value propagation algorithms and the bidirectional value propagation algorithms. The graph computation in
Xinhui Tian, Jianfeng Zhan
doaj +1 more source
Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs
The notion of k-truss has been introduced a decade ago in social network analysis and security for community detection, as a form of cohesive subgraphs less stringent than a clique (set of pairwise linked nodes), and more selective than a k-core (induced
Alessio Conte +4 more
doaj +1 more source
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
Evaluating the effects of the clique selection in exact graph coloring algorithms
It is a common practice in exact enumerative algorithms for graph colouring to find a clique of maximum cardinality and to fix the colours of this subgraph before proceeding with implicit enumeration on the remainder of the graph.
International Journal O. F. Operational Research +10 more
core +1 more source
Node-attribute graph layout for small-world networks [PDF]
Small-world networks are a very commonly occurring type of graph in the real-world, which exhibit a clustered structure that is not well represented by current graph layout algorithms. In many cases we also have information about the nodes in such graphs,
Joe Faith +3 more
core +1 more source
Time and Frequency Resource Allocation Using Graph Theory in OFDMA Wireless Mesh Networks [PDF]
A wireless network with a mesh topology works reliably and offers redundancy. In modern broadband wireless mesh networks that use MIMO and OFDMA techniques, the problems of time, frequency, and space resource allocations are different from a cellular ...
Miri Priesler (Moreno), Arie Reichman
doaj
We are going to analyze local algorithms over sparse random graphs. These algorithms are based on local information where local regards to a decision made by the exploration of a small neighbourhood of a certain vertex plus a believe of the structure of the whole graph and maybe added some randomness.
David Gamarnik +2 more
openaire +3 more sources
Standards for graph algorithm primitives [PDF]
It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building blocks. This paper is a position paper defining the problem and announcing our intention to launch an open effort to define this ...
Tim Mattson +18 more
openaire +5 more sources

