Results 91 to 100 of about 121,460 (194)

On the class of graphs with strong mixing properties

open access: yes, 2013
We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk on the graph.
Isaev, Mikhail, Isaeva, K. V
core   +1 more source

Quantum Algorithm for Finding a Maximum Clique in an Undirected Graph

open access: yesJournal of Information and Organizational Sciences, 2012
The maximum clique in an undirected graph is the largest subset of  a set of graph's vertices where each pair of elements in the subset is connected. In this paper I would like to propose an algorithm for quantum computers that finds a maximum clique in ...
Alan Bojić
doaj  

Optimal Passive Experiment Design for Full Identification of Causal Structure Learning [PDF]

open access: yesIranian Journal of Electrical and Electronic Engineering
Directed Acyclic Graphs stand as one of the prevailing approaches for representing causal relationships within a set of variables. With observational or interventional data, certain undirected edges within a causal DAG can be oriented.
Ramin Safaeian, Mahmoud Tabandeh
doaj  

SymmPi: Exploiting Symmetry Removal for Fast Subgraph Matching

open access: yesData Science and Engineering
Symmetry, a phenomenon of self-similarity, is common in many networks, which often incurs a lot of redundant accesses and computations, even duplicate results when executing graph matching tasks. Many approaches (e.g.
Yujiang Wang   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy