The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for subgraphs with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1966-1976 (17) 1977-1979 (15) 1980-1982 (18) 1983-1984 (16) 1985-1986 (20) 1987 (16) 1988-1989 (33) 1990 (17) 1991 (16) 1992 (32) 1993 (27) 1994 (32) 1995 (37) 1996 (36) 1997 (30) 1998 (45) 1999 (33) 2000 (55) 2001 (52) 2002 (66) 2003 (57) 2004 (104) 2005 (89) 2006 (119) 2007 (148) 2008 (165) 2009 (151) 2010 (70) 2011 (87) 2012 (99) 2013 (107) 2014 (83) 2015 (96) 2016 (112) 2017 (115) 2018 (137) 2019 (106) 2020 (156) 2021 (128) 2022 (128) 2023 (129) 2024 (33)
Publication types (Num. hits)
article(1893) incollection(6) inproceedings(1114) phdthesis(19)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 788 occurrences of 542 keywords

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