Upload
Featured Recent Articles Topics Login Upload

Search Results for 'Subgraph-Query'

Subgraph-Query published presentations and documents on DocSlides.

Relevant Subgraph Extraction
Relevant Subgraph Extraction
by ellena-manuel
Longin Jan Latecki. Based on :. P. . Dupont. , J....
Subexponential Algorithms for Subgraph Isomorphism
Subexponential Algorithms for Subgraph Isomorphism
by ellena-manuel
(and related problems). on Minor-Free Graphs. Han...
Denser than the Densest Subgraph:
Denser than the Densest Subgraph:
by tatiana-dople
Extracting Optimal Quasi-Cliques with Quality . G...
Relevant Subgraph Extraction
Relevant Subgraph Extraction
by olivia-moreira
Longin Jan Latecki. Based on :. P. . Dupont. , J....
Count of Degree
Count of Degree
by briana-ranney
Degree 10 0 10 1 10 2 10 3 10 4 10 5 10 0 10 2 10 ...
Cohesive Subgroups Chapter 7
Cohesive Subgroups Chapter 7
by amber
Feb 20, 2009. Definition of subgroups . Definition...
ETH-hardness of Densest-k-
ETH-hardness of Densest-k-
by quinn
Subgraph. . with Perfect Completeness. Aviad Rubi...
Denser than the Densest Subgraph:
Denser than the Densest Subgraph:
by trish-goza
Extracting Optimal Quasi-Cliques with Quality . G...
Markus Chimani
Markus Chimani
by lindy-dunigan
. & Tilo . Wiedera. . Karsten . Klein. Uni ...
Detecting High LogDensities an Approximation for Densest Subgraph Aditya Bhaskara Moses Charikar Eden Chlamtac Uriel Feige Aravindan Vijayaraghavan Abstract In the Densest Subgraph problem given a
Detecting High LogDensities an Approximation for Densest Subgraph Aditya Bhaskara Moses Charikar Eden Chlamtac Uriel Feige Aravindan Vijayaraghavan Abstract In the Densest Subgraph problem given a
by phoebe-click
There is a signi64257cant gap between the best kn...
Optical Character Recognition:
Optical Character Recognition:
by lois-ondreau
Using the Ullman Algorithm for Graphical Matching...
Densestk-subgraph(DkS):Input:AgraphG=(V;E),jVj=n,andanintegerk,knOutp
Densestk-subgraph(DkS):Input:AgraphG=(V;E),jVj=n,andanintegerk,knOutp
by danika-pritchard
I I Heaviestk-subgraph(HkS):Input:AweightedgraphG=...
An Architecture FRAMEWORK FOR Transparent ISA customization
An Architecture FRAMEWORK FOR Transparent ISA customization
by tawny-fly
Vinay Gangadhar. gangadhar@wisc.edu. . ECE 751 T...
1 k-anonymity in Graphs 2
1 k-anonymity in Graphs 2
by felicity
Methods based on k-anonymity. k-candidate. k-deg...
MA4404 Complex Networks Groups of vertices and
MA4404 Complex Networks Groups of vertices and
by priscilla
Core-periphery structure. Excellence Through Knowl...
Motivation Frequent subgraph
Motivation Frequent subgraph
by mofferro
mining algorithms that allows for label and struct...
Groups of vertices and Core-periphery structure
Groups of vertices and Core-periphery structure
by celsa-spraggs
By: Ralucca Gera, . Applied math department,. Nav...
Planarity and Higher Order
Planarity and Higher Order
by stefany-barnette
Embeddings. Shawn Cox. CS 594: Graph Theory. 3-5-...
CLIQUE RELAXATION MODELS IN SOCIAL NETWORK ANALYSIS
CLIQUE RELAXATION MODELS IN SOCIAL NETWORK ANALYSIS
by lois-ondreau
Jeffrey . Pattillo. , . Nataly. . Youssef. , and...
Graph theory Definitions
Graph theory Definitions
by test
Trees, cycles, directed graphs.. Eulerian, Hamilt...
Algorithmic Analysis
Algorithmic Analysis
by mitsue-stanley
of Large Datasets. . Charal...
1 k-anonymity in Graphs
1 k-anonymity in Graphs
by giovanna-bartolotta
2. Methods based on k-anonymity. k-candidate. k...
Groups of vertices
Groups of vertices
by alida-meadow
and. Core-periphery . structure. By: Ralucca Gera...
Subgraph Isomorphism Problem
Subgraph Isomorphism Problem
by tatyana-admore
Simple algorithms. Given two graphs G = (V,E) and...
ON UNICYCLIC REFLEXIVE
ON UNICYCLIC REFLEXIVE
by test
GRAPHS. The spectrum of a simple graph (non-orien...
Ship Patrol:
Ship Patrol:
by liane-varnes
Multiagent. Patrol under Complex Environmental C...
Algorithmic Analysis
Algorithmic Analysis
by test
of Large Datasets. . Charal...
Error Tolerant Address Configuration for Data
Error Tolerant Address Configuration for Data
by giovanna-bartolotta
Center Networks with Malfunctioning Devices. Xing...
On the use of Graph Search Techniques for the Analysis of E
On the use of Graph Search Techniques for the Analysis of E
by olivia-moreira
Janine Bennett. 1. William . McLendon. III. 1. G...
1 Edge
1 Edge
by karlyn-bohler
Bicoloured. Graphs: Dually Connectedness, . Dual...
Fast
Fast
by calandra-battersby
Distributed Algorithms. . for . (. Weakly) Conne...
Subgraph Matching Kernels for Attributed Graphs Nils K
Subgraph Matching Kernels for Attributed Graphs Nils K
by stefany-barnette
kriegecstudortmundde Petra Mutzel petramutzelcstud...
Denser than the Densest Subgraph Extracting Optimal Qu
Denser than the Densest Subgraph Extracting Optimal Qu
by mitsue-stanley
Tsourakakis Francesco Bonchi Aristides Gionis Fra...
Densest Subgraph in Streaming and MapReduce Bahman Bah
Densest Subgraph in Streaming and MapReduce Bahman Bah
by kittie-lecroy
edu Ravi Kumar Yahoo Research Sunnyvale CA ravikum...
Inapproximabilty of Densest Subgraph from Average Case
Inapproximabilty of Densest Subgraph from Average Case
by giovanna-bartolotta
Both results are of similar avor ruling out const...
Densest Subgraph Approximation on Intersection Graphs
Densest Subgraph Approximation on Intersection Graphs
by alida-meadow
Chen Rudolf Fleischer and Jian Li University o...
The densest subgraph problem on clique graphs M
The densest subgraph problem on clique graphs M
by danika-pritchard
Liazi I Milis F Pascual and V Zissimopoulos Dep...
EVASIVENESS OF SUBGRAPH CONTAINMENT AND RELATED PROPER
EVASIVENESS OF SUBGRAPH CONTAINMENT AND RELATED PROPER
by mitsue-stanley
C OMPUT 2002 Society for Industrial and Applied M...
Algorithm for Subgraph Isomorphism
Algorithm for Subgraph Isomorphism
by danika-pritchard
R. ULLMANN Physical Laboratory, Tedd, ngton, M, dd...
The Combinatorial Multigrid Solver
The Combinatorial Multigrid Solver
by luanne-stotts
Yiannis Koutis, Gary Miller. Carnegie Mellon Univ...