Search results for "subgraphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
70	Jun Huan, Wei Wang 0010, Jan F. Prins, Jiong Yang 0001	SPIN: mining maximal frequent subgraphs from graph databases.	KDD	2004	DBLP DOI BibTeX RDF	subgraph mining, spanning tree
62	Chikoo Oosawa, Michael A. Savageau, Abdul Salam Jarrah, Reinhard C. Laubenbacher, Eduardo D. Sontag	Stabilizing and Destabilizing Effects of Embedding 3-Node Subgraphs on the State Space of Boolean Networks.	ACRI	2008	DBLP DOI BibTeX RDF	transcriptional regulatory networks, Thomas’s conjecture, entropy, feedback, mutual information, subgraph, feedforward, Boolean networks
57	Marija Mitrovic, Bosiljka Tadic	Search of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods.	ICCS (2)	2008	DBLP DOI BibTeX RDF	modular networks, subgraphs, maximum likelihood method
49	Stavros D. Nikolopoulos, Leonidas Palios	Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching.	Panhellenic Conference on Informatics	2005	DBLP DOI BibTeX RDF	P4-sparse graphs, maximum-size subgraphs, perfect matching, maximum matchings, Perfect graphs, cographs
49	Iztok Peterin	Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs.	Order	2004	DBLP DOI BibTeX RDF	flag graphs, induced subgraphs, edge-labellings, Cartesian product graphs, quotient graphs
49	Shuo Zhou, Bo Yao, Hongyu Chen, Yi Zhu 0002, Chung-Kuan Cheng, Michael D. Hutton	Efficient static timing analysis using a unified framework for false paths and multi-cycle paths.	ASP-DAC	2006	DBLP DOI BibTeX RDF	biclique covering, false subgraphs, multi-cycle subgraphs, static timing analysis, time shifting
45	AnGuo Dong, Lin Gao, XiaoFeng Zhou, HongYu Su	An Algebra Approach for Finding Frequent Subgraphs with Hamiltonian Cycle.	FSKD (3)	2007	DBLP DOI BibTeX RDF
45	Sabine Bachl	Isomorphic Subgraphs.	GD	1999	DBLP DOI BibTeX RDF
42	Ming Zhong 0002, Mengchi Liu	Efficient keyword proximity search using a frontier-reduce strategy based on d-distance graph index.	IDEAS	2009	DBLP DOI BibTeX RDF	graph index, keyword proximity search, search space reduction
42	Hong Cheng 0001, David Lo 0001, Yang Zhou 0001, Xiaoyin Wang, Xifeng Yan	Identifying bug signatures using discriminative graph mining.	ISSTA	2009	DBLP DOI BibTeX RDF	bug signature, discriminative subgraph mining
42	Henry C. Lin, Christos Amanatidis, Martha Sideri, Richard M. Karp, Christos H. Papadimitriou	Linked decompositions of networks and the power of choice in Polya urns.	SODA	2008	DBLP BibTeX RDF
42	Kouzou Ohara, Masahiro Hara, Kiyoto Takabayashi, Hiroshi Motoda, Takashi Washio	Pruning Strategies Based on the Upper Bound of Information Gain for Discriminative Subgraph Mining.	PKAW	2008	DBLP DOI BibTeX RDF	discriminative subgraph, data mining, Graph mining, information gain
42	David H. White 0001, Richard C. Wilson 0001	Parts based generative models for graphs.	ICPR	2008	DBLP DOI BibTeX RDF
42	Hiroshi Motoda	Pattern Discovery from Graph-Structured Data - A Data Mining Perspective.	IEA/AIE	2007	DBLP DOI BibTeX RDF
42	Jianyong Wang 0001, Zhiping Zeng, Lizhu Zhou	CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases.	ICDE	2006	DBLP DOI BibTeX RDF
42	Junmei Wang, Wynne Hsu, Mong-Li Lee, Chang Sheng	A Partition-Based Approach to Graph Mining.	ICDE	2006	DBLP DOI BibTeX RDF
42	Xiaotong Zhuang, Vincenzo Liberatore	A Recursion-Based Broadcast Paradigm in Wormhole Routed Networks.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	parallel processing, Hypercube, mesh, wormhole routing, torus, massive parallel computer, one-to-all broadcast
42	Nathan Clark, Manjunath Kudlur, Hyunchul Park 0001, Scott A. Mahlke, Krisztián Flautner	Application-Specific Processing on a General-Purpose Core via Transparent Instruction Set Customization.	MICRO	2004	DBLP DOI BibTeX RDF
40	Moti Cohen, Ehud Gudes	Diagonally Subgraphs Pattern Mining.	DMKD	2004	DBLP DOI BibTeX RDF	graph mining, pattern discovery, frequent subgraphs
40	Pieter H. Hartel	The Average Size of Ordered Binary Subgraphs.	WG	1988	DBLP DOI BibTeX RDF	binary graphs Catalan statistics, combinator graph reduction, subgraphs
40	Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, James Cheng, Byron Choi	GBLENDER: towards blending visual query formulation and query processing in graph databases.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	infrequent subgraphs, visual query formulation, prefetching, graph databases, frequent subgraphs, graph indexing
37	Chun-Hua Fu, Yue-Ping Zhou, Xiu-Lian Xu, Hui Chang, Ai-Xia Feng, Jianjun Shi, Da-Ren He	Recognition of Important Subgraphs in Collaboration Networks.	Complex (1)	2009	DBLP DOI BibTeX RDF	shifted power law, bipartite graph, clique, collaboration network, subgraph
37	Tao Li 0008, Zhigang Sun, Wu Jigang, Xicheng Lu	Fast enumeration of maximal valid subgraphs for custom-instruction identification.	CASES	2009	DBLP DOI BibTeX RDF	ISE identification, custom processors, maximal subgraph
37	Zheng Liu 0001, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin 0001, Lei Chen 0002	Spotting Significant Changing Subgraphs in Evolving Graphs.	ICDM	2008	DBLP DOI BibTeX RDF
37	Jia-yang Peng, Luming Yang, Jianxin Wang 0001, Zheng Liu, Ming Li	An Efficient Algorithm for Detecting Closed Frequent Subgraphs in Biological Networks.	BMEI (1)	2008	DBLP DOI BibTeX RDF	Closed frequent subgraph, Graph mining, FP-tree, Biological networks, FP-growth
37	Anne-Thérèse Körtgen	Modeling Successively Connected Repetitive Subgraphs.	AGTIVE	2007	DBLP DOI BibTeX RDF
37	Véronique Delouille, Ramesh Neelamani, Richard G. Baraniuk	Robust Distributed Estimation Using the Embedded Subgraphs Algorithm.	IEEE Trans. Signal Process.	2006	DBLP DOI BibTeX RDF
37	Sung-Ho Kim 0002	Properties of Markovian Subgraphs of a Decomposable Graph.	MICAI	2006	DBLP DOI BibTeX RDF
37	Cartic Ramakrishnan, William H. Milnor, Matthew Perry, Amit P. Sheth	Discovering informative connection subgraphs in multi-relational graphs.	SIGKDD Explor.	2005	DBLP DOI BibTeX RDF	multi-relational graphs, semantic pattern discovery in RDF graphs, subgraph discovery
37	Michihiro Kuramochi, George Karypis	An Efficient Algorithm for Discovering Frequent Subgraphs.	IEEE Trans. Knowl. Data Eng.	2004	DBLP DOI BibTeX RDF	scientific data sets, chemical compound data sets, Data mining, frequent pattern discovery
37	Michihiro Kuramochi, George Karypis	Discovering Frequent Geometric Subgraphs.	ICDM	2002	DBLP DOI BibTeX RDF
37	Sabine Bachl, Franz-Josef Brandenburg	Computing and Drawing Isomorphic Subgraphs.	GD	2002	DBLP DOI BibTeX RDF
37	Yon Dourisboure, Filippo Geraci, Marco Pellegrini 0001	Extraction and classification of dense communities in the web.	WWW	2007	DBLP DOI BibTeX RDF	communities, web graph, dense subgraphs
37	Min Chih Lin, Jayme Luiz Szwarcfiter	Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs.	COCOON	2006	DBLP DOI BibTeX RDF	Helly circular-arc graphs, algorithms, forbidden subgraphs, circular-arc graphs
33	Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger	Partitioning Graphs into Connected Parts.	CSR	2009	DBLP DOI BibTeX RDF
33	Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu Yu, Wee Keong Ng	A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs.	DASFAA	2009	DBLP DOI BibTeX RDF
33	Xiaoyong Chen, Douglas L. Maskell, Yang Sun	Fast Identification of Custom Instructions for Extensible Processors.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2007	DBLP DOI BibTeX RDF
33	Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters	Clustering Improves the Exploration of Graph Mining Results.	AIAI	2007	DBLP DOI BibTeX RDF
33	Liang Lin, Song Chun Zhu, Yongtian Wang	Layered Graph Match with Graph Editing.	CVPR	2007	DBLP DOI BibTeX RDF
33	Christian Borgelt, Mathias Fiedler	Graph Mining: Repository vs. Canonical Form.	GfKl	2007	DBLP DOI BibTeX RDF
33	Sami Yehia, Nathan Clark, Scott A. Mahlke, Krisztián Flautner	Exploring the design space of LUT-based transparent accelerators.	CASES	2005	DBLP DOI BibTeX RDF	accelerator design, embedded processing, efficient computation
33	Nathan Clark, Jason A. Blome, Michael L. Chu, Scott A. Mahlke, Stuart Biles, Krisztián Flautner	An Architecture Framework for Transparent Instruction Set Customization in Embedded Processors.	ISCA	2005	DBLP DOI BibTeX RDF
33	Phu Chien Nguyen, Takashi Washio, Kouzou Ohara, Hiroshi Motoda	Using a Hash-Based Method for Apriori-Based Graph Mining.	PKDD	2004	DBLP DOI BibTeX RDF
33	Christian Haase 0001, Günter M. Ziegler	Examples and Counterexamples for the Perles Conjecture.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
33	Emo Welzl	Entering and Leaving j-Facets.	Discret. Comput. Geom.	2001	DBLP DOI BibTeX RDF
33	Qian-Ping Gu, Shietung Peng	Cluster Fault Tolerant Routing in Hypercubes.	ICPP	1998	DBLP DOI BibTeX RDF
33	Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng	Min-Max-Boundary Domain Decomposition.	COCOON	1998	DBLP DOI BibTeX RDF
33	Shan Fan Liu, Mary Lou Soffa	Parallel Task Assignment by Graph Partitioning.	PARLE	1992	DBLP DOI BibTeX RDF
32	Joseph Cheriyan, Ramakrishna Thurimella	Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract).	FOCS	1996	DBLP DOI BibTeX RDF	minimum-size, k-connected spanning subgraphs, k-NCSS, k-ECSS, graph theory, heuristic, matching, undirected graphs
29	Zhaonian Zou, Hong Gao 0001, Jianzhong Li 0001	Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics.	KDD	2010	DBLP DOI BibTeX RDF	probabilistic semantics, uncertain graph, frequent subgraph
29	Daniël Paulusma, Johan M. M. van Rooij	On Partitioning a Graph into Two Connected Subgraphs.	ISAAC	2009	DBLP DOI BibTeX RDF
29	JianBin Wang, Bin-Hui Chou, Einoshin Suzuki	Finding the k-Most Abnormal Subgraphs from a Single Graph.	Discovery Science	2009	DBLP DOI BibTeX RDF
29	Samir Khuller, Barna Saha	On Finding Dense Subgraphs.	ICALP (1)	2009	DBLP DOI BibTeX RDF
29	Omid Amini, Fedor V. Fomin, Saket Saurabh 0001	Counting Subgraphs via Homomorphisms.	ICALP (1)	2009	DBLP DOI BibTeX RDF
29	Reid Andersen, Kumar Chellapilla	Finding Dense Subgraphs with Size Bounds.	WAW	2009	DBLP DOI BibTeX RDF
29	Venkat Chandrasekaran, Jason K. Johnson, Alan S. Willsky	Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis.	IEEE Trans. Signal Process.	2008	DBLP DOI BibTeX RDF
29	Min Li 0007, Jianxin Wang 0001, Jianer Chen, Bin Hu	Greedily Mining l-dense Subgraphs in Protein Interaction Networks.	ICYCS	2008	DBLP DOI BibTeX RDF
29	Nan Wang, Srinivasan Parthasarathy 0001, Kian-Lee Tan, Anthony K. H. Tung	CSV: visualizing and mining cohesive subgraphs.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	graph density, data mining, visualization, graph mining, clique
29	Hans Zantema, Stefan Wagemans, Dragan Bosnacki	Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets.	BIRD	2008	DBLP DOI BibTeX RDF
29	Tomonobu Ozaki, Takenao Ohkawa	Mining Correlated Subgraphs in Graph Databases.	PAKDD	2008	DBLP DOI BibTeX RDF
29	Duygu Ucar, Sitaram Asur, Ümit V. Çatalyürek, Srinivasan Parthasarathy 0001	Improving Functional Modularity in Protein-Protein Interactions Graphs Using Hub-Induced Subgraphs.	PKDD	2006	DBLP DOI BibTeX RDF
29	Huahai He, Ambuj K. Singh	GraphRank: Statistical Modeling and Mining of Significant Subgraphs in the Feature Space.	ICDM	2006	DBLP DOI BibTeX RDF
29	Hanghang Tong, Christos Faloutsos	Center-piece subgraphs: problem definition and fast solutions.	KDD	2006	DBLP DOI BibTeX RDF	KAND, center-piece subgraph, goodness score
29	Jinyan Li 0001, Haiquan Li, Donny Soh, Limsoon Wong	A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns.	PKDD	2005	DBLP DOI BibTeX RDF
29	Michel X. Goemans, Jan Vondrák	Covering minimum spanning trees of random subgraphs.	SODA	2004	DBLP BibTeX RDF
29	Aixin Sun, Ee-Peng Lim	Web unit mining: finding and classifying subgraphs of web pages.	CIKM	2003	DBLP DOI BibTeX RDF	web unit, web unit mining, web classification
29	Haodi Feng	(g, f)-Factorizations Orthogonal to k Subgraphs.	WG	2001	DBLP DOI BibTeX RDF
28	William B. Langdon, Wolfgang Banzhaf	Repeated patterns in genetic programming.	Nat. Comput.	2008	DBLP DOI BibTeX RDF	Genetic alogorithms, ALU, Macky-Glass, Poly-10, Nuclear protein localisation, Tiny GP, GPquick, Evolution of program shape, Sensitivity analysis, Frequent subgraphs, SINE, Frequent subtrees
28	Jittat Fakcharoenphol, Bundit Laekhanukit	An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms for NP-hard problems, k-connected spanning subgraphs, network design
28	James Cheng, Yiping Ke, Wilfred Ng, An Lu	Fg-index: towards verification-free query processing on graph databases.	SIGMOD Conference	2007	DBLP DOI BibTeX RDF	graph databases, frequent subgraphs, graph indexing, graph querying
28	Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter	Proper Helly Circular-Arc Graphs.	WG	2007	DBLP DOI BibTeX RDF	Helly circular-arc graphs, proper circular-arc graphs, unit circular-arc graphs, algorithms, forbidden subgraphs
28	Jeremiah Nummela, Bryant A. Julstrom	An effective genetic algorithm for the minimum-label spanning tree problem.	GECCO	2006	DBLP DOI BibTeX RDF	labeled spanning trees, spanning subgraphs, genetic algorithms, local search, greedy heuristics
28	Kishore N. Menezes, Sumedh W. Sathaye, Thomas M. Conte	Path Prediction for High Issue-Rate Processors.	IEEE PACT	1997	DBLP DOI BibTeX RDF	high issue-rate processors, path prediction, issue bandwidth, multiple branches, path prediction automaton, arbitrary subgraphs, scalability single access prediction, low hardware cost, instruction-level parallelism, pipeline processing, speculative execution, cycle, performance improvement
28	Nabil Kahalé	Eigenvalues and Expansion of Regular Graphs.	J. ACM	1995	DBLP DOI BibTeX RDF	induced subgraphs, selection networks, load balancing, random walks, eigenvalues, expander graphs, Ramanujan graphs
28	Shahram Latifi	Task Allocation in the Star Graph.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	processor interconnection, special subgraphs, substars, star code, statically optimal, recognition ability, substarrecognition, graph theory, resource allocation, parallel architectures, multiprocessor interconnection networks, task allocation, star graph, topological features
28	Zhenyu Wu, Richard M. Leahy	An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	optimal graph theoretic approach, undirected adjacency graph, arc capacities, mutually exclusive subgraphs, largest inter-subgraph maximum flow minimization, flow and cut equivalent tree partitioning, subgraph condensation, partially equivalent tree, region boundary location, closed edge contours, pattern recognition, image segmentation, image segmentation, graph theory, data clustering, minimax techniques
28	Deng-Jyi Chen, Tien-Hsiang Huang	Reliability Analysis of Distributed Systems Based on a Fast Reliability Algorithm.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	distributed program reliability, distributed systemreliability, reliability performance indexes, disjoint file spanning trees, unionoperation, graph theory, distributed processing, probability, software reliability, programming theory, nodes, subgraphs, performanceevaluation, distributed processing system
25	Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva	g-tries: an efficient data structure for discovering network motifs.	SAC	2010	DBLP DOI BibTeX RDF	algorithms, data structures, complex networks, graph mining, biological networks, tries, network motifs
25	Arijit Khan 0001, Xifeng Yan, Kun-Lung Wu	Towards proximity pattern mining in large graphs.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	graph, pattern, association, mining
25	Ning Jin, Calvin Young, Wei Wang 0010	GAIA: graph classification using evolutionary computation.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	graph mining, graph classification
25	Victor Olman, Fenglou Mao, Hongwei Wu, Ying Xu 0001	Parallel Clustering Algorithm for Large Data Sets with Applications in Bioinformatics.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	genome application, Pattern recognition, parallel processing, clustering algorithm
25	Bingjun Sun, Prasenjit Mitra, C. Lee Giles	Independent informative subgraph mining for graph information retrieval.	CIKM	2009	DBLP DOI BibTeX RDF	index pruning, feature selection, graph mining, graph search
25	Wan-Jui Lee, Robert P. W. Duin	A Labelled Graph Based Multiple Classifier System.	MCS	2009	DBLP DOI BibTeX RDF
25	Robert Joan-Arinyo, Marta I. Tarrés-Puertas, Sebastià Vila-Marta	Treedecomposition of geometric constraint graphs based on computing graph circuits.	Symposium on Solid and Physical Modeling	2009	DBLP DOI BibTeX RDF
25	Risi Kondor, Nino Shervashidze, Karsten M. Borgwardt	The graphlet spectrum.	ICML	2009	DBLP DOI BibTeX RDF
25	Jean Cousty, Laurent Najman, Jean Serra	Some Morphological Operators in Graph Spaces.	ISMM	2009	DBLP DOI BibTeX RDF
25	Apostolos N. Papadopoulos, Apostolos Lyritsis, Yannis Manolopoulos	SkyGraph: an algorithm for important subgraph discovery in relational graphs.	Data Min. Knowl. Discov.	2008	DBLP DOI BibTeX RDF	Skyline processing, Graph mining, Edge connectivity
25	Sebastian Nowozin, Koji Tsuda	Frequent Subgraph Retrieval in Geometric Graph Databases.	ICDM	2008	DBLP DOI BibTeX RDF
25	Ilaria Bordino, Debora Donato, Aristides Gionis, Stefano Leonardi 0001	Mining Large Networks with Subgraph Counting.	ICDM	2008	DBLP DOI BibTeX RDF
25	Jia Wu, Ling Chen	A Fast Frequent Subgraph Mining Algorithm.	ICYCS	2008	DBLP DOI BibTeX RDF
25	Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman	Graph Summaries for Subgraph Frequency Estimation.	ESWC	2008	DBLP DOI BibTeX RDF	Graph summaries, Data summaries, Frequency estimation
25	Joachim Falk, Joachim Keinert, Christian Haubelt, Jürgen Teich, Shuvra S. Bhattacharyya	A generalized static data flow clustering algorithm for mpsoc scheduling of multimedia applications.	EMSOFT	2008	DBLP DOI BibTeX RDF	actor-oriented design, mpsoc scheduling, software synthesis
25	Luis González Abril	Splitting the Unity, Bisecting a Graph: Applications to Stochastic Boolean Systems.	ICCSA (2)	2008	DBLP DOI BibTeX RDF
25	Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin 0001, Haixun Wang, Philip S. Yu	Fast computing reachability labelings for large graphs with high compression rate.	EDBT	2008	DBLP DOI BibTeX RDF
25	Malcolm Ryan 0001	Constraint-Based Multi-agent Path Planning.	Australasian Conference on Artificial Intelligence	2008	DBLP DOI BibTeX RDF
25	Paolo Bonzini, Laura Pozzi	Polynomial-time subgraph enumeration for automated instruction set extension.	DATE	2007	DBLP DOI BibTeX RDF
25	Gábor Kun, Jaroslav Nesetril	NP by Means of Lifts and Shadows.	MFCS	2007	DBLP DOI BibTeX RDF	duality, Constraint Satisfaction Problem, homomorphism, Digraph, NP
25	Lini T. Thomas, Satyanarayana R. Valluri, Kamalakar Karlapalem	MARGIN: Maximal Frequent Subgraph Mining.	ICDM	2006	DBLP DOI BibTeX RDF
25	Guimei Liu, Kelvin Sim, Jinyan Li 0001	Efficient Mining of Large Maximal Bicliques.	DaWaK	2006	DBLP DOI BibTeX RDF
25	Xiaoyong Chen, Douglas L. Maskell, Yang Sun	Automatic Identification of Custom Functions for Embedded Processors with MIMO Extensions.	APCCAS	2006	DBLP DOI BibTeX RDF