Search results for "k-Subgraph"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
76	MohammadAli Safari, Mohammad R. Salavatipour	A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
69	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
69	Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh 0001	Degree-Constrained Subgraph Problems: Hardness and Approximation Results.	WAOA	2008	DBLP DOI BibTeX RDF	Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS
69	Enhong Chen, Xujia Chen, Phillip C.-Y. Sheu, Tieyun Qian	An Evolutionary Computational Method for N-Connection Subgraph Discovery.	ICTAI	2006	DBLP DOI BibTeX RDF
65	Samir Khuller, Barna Saha	On Finding Dense Subgraphs.	ICALP (1)	2009	DBLP DOI BibTeX RDF
62	Zhaonian Zou, Jianzhong Li 0001, Hong Gao 0001, Shuo Zhang	Frequent subgraph pattern mining on uncertain graph data.	CIKM	2009	DBLP DOI BibTeX RDF	expected support, subgraph pattern, uncertain graph
62	Yao Wu, Louiqa Raschid	ApproxRank: Estimating Rank for a Subgraph.	ICDE	2009	DBLP DOI BibTeX RDF
62	Changliang Wang, Lei Chen 0002	Continuous Subgraph Pattern Search over Graph Streams.	ICDE	2009	DBLP DOI BibTeX RDF
62	Christian Schellewald	A Bound for Non-subgraph Isomorphism.	GbRPR	2007	DBLP DOI BibTeX RDF
59	Horst Bunke	Error Correcting Graph Matching: On the Influence of the Underlying Cost Function.	IEEE Trans. Pattern Anal. Mach. Intell.	1999	DBLP DOI BibTeX RDF	maximum common subgraph, error correcting graph matching, edit operation, Graph, graph matching, graph isomorphism, cost function, subgraph isomorphism, subgraph, graph edit distance
59	Hongzhi Wang 0001, Wei Wang 0011, Xuemin Lin 0001, Jianzhong Li 0001	Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document.	WAIM	2005	DBLP DOI BibTeX RDF
59	Andrzej Lingas, Andrzej Proskurowski	Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs.	FSTTCS	1987	DBLP DOI BibTeX RDF
58	András Faragó	A General Tractable Density Concept for Graphs.	Math. Comput. Sci.	2008	DBLP DOI BibTeX RDF	graph density, densest subgraph, Graph algorithm
55	Virginia Vassilevska, Ryan Williams 0001, Raphael Yuster	Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems.	ICALP (1)	2006	DBLP DOI BibTeX RDF
52	Sebastian Wernicke 0001	Efficient Detection of Network Motifs.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	Network motif detection algorithm, subgraph enumeration, subgraph sampling, subgraph concentration in random graphs
51	Huahai He, Ambuj K. Singh	Closure-Tree: An Index Structure for Graph Queries.	ICDE	2006	DBLP DOI BibTeX RDF
48	Akiko Suzuki, Takeshi Tokuyama	Dense subgraph problems with output-density conditions.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	approximation algorithms, Combinatorial optimization, randomized algorithms, dense subgraph
48	Timo Poranen	Heuristics for the Maximum Outerplanar Subgraph Problem.	J. Heuristics	2005	DBLP DOI BibTeX RDF	triangular cactus heuristic, maximum outerplanar subgraph problem, simulated annealing
48	Elder M. Macambira	An Application of Tabu Search Heuristic for the Maximum Edge-Weighted Subgraph Problem.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	edge-weighted subgraph problem, combinatorial optimization, tabu search, metaheuristics
47	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
47	Andrzej Lingas, Martin Wahlen	On Exact Complexity of Subgraph Homeomorphism.	TAMC	2007	DBLP DOI BibTeX RDF
47	Atsuko Yamaguchi, Hiroshi Mamitsuka	Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees.	ISAAC	2003	DBLP DOI BibTeX RDF
47	Donatello Conte, Corrado Guidobaldi, Carlo Sansone	A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs.	GbRPR	2003	DBLP DOI BibTeX RDF
47	Wing Ning Li	Convergent transfer subgraph characterization and computation.	ISCAS (3)	2003	DBLP DOI BibTeX RDF
44	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
44	Hongzhi Wang 0001, Jianzhong Li 0001, Wei Wang 0011, Xuemin Lin 0001	Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document.	World Wide Web	2008	DBLP DOI BibTeX RDF	subgraph query, XML, query processing, coding, structural join
44	Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger	Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.	SWAT	2002	DBLP DOI BibTeX RDF	computational complexity, graph coloring, planar graph, graph partitioning, forbidden subgraph
43	Xiangnan Kong, Philip S. Yu	Semi-supervised feature selection for graph classification.	KDD	2010	DBLP DOI BibTeX RDF	data mining, feature selection, semi-supervised learning, graph classification
43	Reid Andersen, Kumar Chellapilla	Finding Dense Subgraphs with Size Bounds.	WAW	2009	DBLP DOI BibTeX RDF
43	Petra Mutzel	A Polyhedral Approach to Planar Augmentation and Related Problems.	ESA	1995	DBLP DOI BibTeX RDF
43	Thomas Andreae, Michael Nölle, Gerald Schreiber	Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract).	WG	1994	DBLP DOI BibTeX RDF	processor networks, parallel image processing and pattern recognition, dilation, graph embeddings, massively parallel computers, Cartesian product, de Bruijn graphs
41	Guy Kortsarz, David Peleg	On Choosing a Dense Subgraph (Extended Abstract)	FOCS	1993	DBLP DOI BibTeX RDF	weighted problem, densest k-vertex subgraph, most edges, edges-to-vertices ratio, unweighted graph problem, maximization problems, approximation algorithms, approximation ratio, dense subgraph
41	Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis	The Parallel Complexity of the Subgraph Connectivity Problem	FOCS	1989	DBLP DOI BibTeX RDF	triconnected components, subgraph connectivity problem, induced subgraph, cardinality, parallel complexity, P-complete
41	Jack Brimberg, Nenad Mladenovic, Dragan Urosevic	Local and variable neighborhood search for the k -cardinality subgraph problem.	J. Heuristics	2008	DBLP DOI BibTeX RDF	k-subgraph, Variable neighborhood search
41	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
41	Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos	The densest k-subgraph problem on clique graphs.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Densest k-subgraph, Clique graph, Dynamic programming, Polynomial time approximation scheme
40	Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra	Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph.	FOCS	2008	DBLP DOI BibTeX RDF
40	Xiuzhen Huang, Jing Lai	Maximum Common Subgraph: Upper Bound and Lower Bound Results.	IMSCCS (1)	2006	DBLP DOI BibTeX RDF
40	Horst Bunke, Pasquale Foggia, Corrado Guidobaldi, Carlo Sansone, Mario Vento	A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs.	SSPR/SPR	2002	DBLP DOI BibTeX RDF
40	Robert Carr, R. Ravi 0001	A New Bound for the 2-Edge Connected Subgraph Problem.	IPCO	1998	DBLP DOI BibTeX RDF
40	Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu	A New Subgraph of Minimum Weight Triangulations.	ISAAC	1996	DBLP DOI BibTeX RDF
40	Viggo Kann	On the Approximability of the Maximum Common Subgraph Problem.	STACS	1992	DBLP DOI BibTeX RDF	computational complexity, Approximation, graph problems
37	Yehuda Koren, Stephen C. North, Chris Volinsky	Measuring and extracting proximity graphs in networks.	ACM Trans. Knowl. Discov. Data	2007	DBLP DOI BibTeX RDF	Connection subgraph, cycle-free escape probability, escape probability, proximity subgraph, random walk, graph mining, proximity
37	Chang-Wu Yu 0001	Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm.	ESCAPE	2007	DBLP DOI BibTeX RDF	subgraph counting, subgraph probability, Random geometric graphs
37	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
37	Rebecca Robinson, Graham Farr	Structure and Recognition of Graphs with No 6-wheel Subdivision.	Algorithmica	2009	DBLP DOI BibTeX RDF	Topological containment, Subgraph homeomorphism problem, Graph algorithms, Subdivisions
37	Cun-Quan Zhang, Yongbin Ou	Clustering, community partition and disjoint spanning trees.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	dynamic density, clustering, community, hierarchical clustering, Spanning trees, polynomial algorithm, dense subgraph
37	Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger	Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult.	Algorithmica	2006	DBLP DOI BibTeX RDF	Computational complexity, Graph coloring, Planar graph, Graph partitioning, Forbidden subgraph
37	Guy Kortsarz, Zeev Nutov	Approximating Node Connectivity Problems via Set Covers.	Algorithmica	2003	DBLP DOI BibTeX RDF	Vertex connected spanning subgraph, Metric costs, Approximation algorithms
37	Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger	On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.	FSTTCS	2002	DBLP DOI BibTeX RDF	minimum-cost biconnected spanning subgraph, Approximation algorithm, inapproximability, augmentation
37	Jon Feldman, Matthias Ruhl	The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals.	FOCS	1999	DBLP DOI BibTeX RDF	Directed Steiner Network, Point-to-Point Connection Problem, Strongly Connected Steiner Subgraph, directed graphs, network design, polynomial-time algorithms
36	Hanna Kalosha, Amiya Nayak, Stefan Rührup, Ivan Stojmenovic	Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks.	INFOCOM	2008	DBLP DOI BibTeX RDF
36	Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko	Approximating Minimum-Power Degree and Connectivity Problems.	LATIN	2008	DBLP DOI BibTeX RDF
36	Refael Hassin, Danny Segev	Robust subgraphs for trees and paths.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	Approximation algorithms, decomposition, spanning trees, robust optimization
36	Refael Hassin, Danny Segev	Robust Subgraphs for Trees and Paths.	SWAT	2004	DBLP DOI BibTeX RDF
36	Béla Bollobás, Don Coppersmith, Michael Elkin	Sparse distance preservers and additive spanners.	SODA	2003	DBLP BibTeX RDF
36	John C. S. Lui	Constructing Communication Subgraphs and Deriving an Optimal Synchronization Interval for Distributed Virtual Environment Systems.	IEEE Trans. Knowl. Data Eng.	2001	DBLP DOI BibTeX RDF	optimal synchronization interval, Markov chains, Distributed virtual environment, fundamental matrix
36	D. I. Carson	On O(p2) algorithms for planarization.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1993	DBLP DOI BibTeX RDF
34	Jens Lischka, Holger Karl	A virtual network mapping algorithm based on subgraph isomorphism detection.	VISA	2009	DBLP DOI BibTeX RDF	virtual network mapping, resource allocation, virtualization, subgraph isomorphism, network embedding
34	Anna Nepomniaschaya	Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph.	PaCT	2009	DBLP DOI BibTeX RDF	Directed weighted graph, subgraph of the shortest paths, decremental algorithm, associative parallel processor, access data by contents, adjacency matrix
34	Tu-Anh Nguyen-Hoang, Kiem Hoang	Frequent Subgraph-Based Approach for Classifying Vietnamese Text Documents.	ICEIS	2009	DBLP DOI BibTeX RDF	Text classification, Graph mining, Frequent subgraph, Vietnamese
34	Michihiro Kuramochi, George Karypis	GREW-A Scalable Frequent Subgraph Discovery Algorithm.	ICDM	2004	DBLP DOI BibTeX RDF	graph mining, frequent subgraph, frequent pattern discovery
34	Bruno T. Messmer, Horst Bunke	Efficient Subgraph Isomorphism Detection: A Decomposition Approach.	IEEE Trans. Knowl. Data Eng.	2000	DBLP DOI BibTeX RDF	Graph matching, preprocessing, graph isomorphism, subgraph isomorphism
34	Ryuhei Uehara	Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph.	ISPAN	1999	DBLP DOI BibTeX RDF	the lexicographically first maximal subgraph problems, threshold function of a random graph, Analysis of algorithms, P-completeness, NC algorithms
34	Bruno T. Messmer, Horst Bunke	A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection.	IEEE Trans. Pattern Anal. Mach. Intell.	1998	DBLP DOI BibTeX RDF	error-correcting graph matching, search, Graphs, graph algorithms, graph matching, graph decomposition, subgraph isomorphism
34	Ryuhei Uehara	A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems.	WG	1997	DBLP DOI BibTeX RDF	the lexicographically first maximal independent set problem, the lexicographically first maximal subgraph problems, Analysis of algorithms, P-completeness, NC algorithms
33	Lorenzo De Nardo, Francesco Ranzato, Francesco Tapparo	The Subgraph Similarity Problem.	IEEE Trans. Knowl. Data Eng.	2009	DBLP DOI BibTeX RDF
33	Fan Chung Graham, Paul Horn, Linyuan Lu	The Giant Component in a Random Subgraph of a Given Graph.	WAW	2009	DBLP DOI BibTeX RDF
33	N. R. Aravind, C. R. Subramanian 0001	Forbidden Subgraph Colorings and the Oriented Chromatic Number.	IWOCA	2009	DBLP DOI BibTeX RDF
33	Tamás Horváth 0001, Jan Ramon	Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth.	ECML/PKDD (1)	2008	DBLP DOI BibTeX RDF
33	Omid Amini, Ignasi Sau, Saket Saurabh 0001	Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.	IWPEC	2008	DBLP DOI BibTeX RDF
33	Petteri Hintsanen	The Most Reliable Subgraph Problem.	PKDD	2007	DBLP DOI BibTeX RDF
33	Miquel Ferrer, Francesc Serratosa, Ernest Valveny	On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs.	GbRPR	2007	DBLP DOI BibTeX RDF
33	Moses Charikar, Konstantin Makarychev, Yury Makarychev	On the Advantage over Random for Maximum Acyclic Subgraph.	FOCS	2007	DBLP DOI BibTeX RDF
33	Jiahai Wang	A Hybrid of Particle Swarm Optimization and Hopfield Networks for Bipartite Subgraph Problems.	ISNN (3)	2007	DBLP DOI BibTeX RDF
33	Akiko Suzuki, Takeshi Tokuyama	Dense Subgraph Problems with Output-Density Conditions.	ISAAC	2005	DBLP DOI BibTeX RDF
33	Ensheng Yu, Xicheng Wang	A Subgraph Isomorphism Algorithm Based on Hopfield Neural Network.	ISNN (1)	2004	DBLP DOI BibTeX RDF
33	Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher	Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract).	WG	2003	DBLP DOI BibTeX RDF
33	Mohammad Taghi Hajiaghayi, Naomi Nishimura	Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth.	MFCS	2002	DBLP DOI BibTeX RDF
33	Matthew Dickerson, J. Mark Keil, Mark H. Montague	A Large Subgraph of the Minimum Weight Triangulation.	Discret. Comput. Geom.	1997	DBLP DOI BibTeX RDF
33	Arvind Gupta, Naomi Nishimura	Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width.	STACS	1996	DBLP DOI BibTeX RDF
33	Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim	The Parallel Complexity of Approximating the High Degree Subgraph Problem.	ISAAC	1995	DBLP DOI BibTeX RDF
33	Heiko Dörr	Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time.	WG	1994	DBLP DOI BibTeX RDF
30	Zhiping Zeng, Jianyong Wang 0001, Lizhu Zhou, George Karypis	Out-of-core coherent closed quasi-clique mining from large dense graph databases.	ACM Trans. Database Syst.	2007	DBLP DOI BibTeX RDF	coherent subgraph, frequent closed subgraph, quasi-clique, Graph mining, out-of-core algorithm
30	Yehuda Koren, Stephen C. North, Chris Volinsky	Measuring and extracting proximity in networks.	KDD	2006	DBLP DOI BibTeX RDF	connection subgraph, cycle-free escape probability, escape probability, proximity subgraph, random walks, proximity
29	Mohammad Shafkat Amin, Anupam Bhattacharjee, Hasan M. Jamil	A cytoscape based framework for efficient sub-graph isomorphic protein-protein interaction motif lookup.	SAC	2010	DBLP DOI BibTeX RDF	Cytoscape plugin, subgraph isomorphism, protein-protein interaction network
29	Keehyung Kim, Byung Ro Moon	Malware detection based on dependency graph using hybrid genetic algorithm.	GECCO	2010	DBLP DOI BibTeX RDF	genetic algorithm, dependency graph, malware detection, subgraph isomorphism
29	Yokesh Kumar, Prosenjit Gupta	External memory layout vs. schematic.	ACM Trans. Design Autom. Electr. Syst.	2009	DBLP DOI BibTeX RDF	verification of layouts, Graph, design automation, external memory algorithms, subgraph isomorphism
29	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
29	Philippe Vismara, Benoît Valéry	Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms.	MCO	2008	DBLP DOI BibTeX RDF	Maximum common subgraph, linegraph, subdivision graph, compatibility graph, constraints satisfaction algorithm, clique detection
29	Shih-Yao Yang, Von-Wun Soo	Comparing the Conceptual Graphs Extracted from Patent Claims.	SUTC	2008	DBLP DOI BibTeX RDF	maximal common subgraph, conceptual graph, patent
29	Adrian Kosowski, Michal Malafiejski, Pawel Zylinski	Packing [1, Delta] -factors in graphs of small degree.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Packing factors, Edge-colorable subgraph, Fault tolerant guards
29	Philip Brisk, Majid Sarrafzadeh	Interference graphs for procedures in static single information form are interval graphs.	SCOPES	2007	DBLP DOI BibTeX RDF	k-colorable subgraph problem, linear scan register allocation, static single information (SSI) form, compilers, register allocation, interval graph
29	H. D. K. Moonesinghe, Hamed Valizadegan, Samah Jamal Fodeh, Pang-Ning Tan	A Probabilistic Substructure-Based Approach for Graph Classification.	ICTAI (1)	2007	DBLP DOI BibTeX RDF	frequent subgraph mining, Maximum entropy, Graph classification
29	Jaroslav Nesetril, Patrice Ossona de Mendez	Linear time low tree-width partitions and algorithmic consequences.	STOC	2006	DBLP DOI BibTeX RDF	bounded expansion, fraternal augmentation, coloration, first order logic, subgraph isomorphism, tree-width, graph minor
29	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
29	Peter J. Dickinson, Horst Bunke, Arek Dadej, Miro Kraetzl	Matching graphs with unique node labels.	Pattern Anal. Appl.	2004	DBLP DOI BibTeX RDF	Maximum common subgraph, Median graph, Unique node label, Graph matching, Graph isomorphism, Graph edit distance
29	Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jack Snoeyink, Jan F. Prins, Alexander Tropsha	Mining protein family specific residue packing patterns from protein structure graphs.	RECOMB	2004	DBLP DOI BibTeX RDF	almost-delaunay, subgraph mining, protein classification
29	Christophe Irniger, Horst Bunke	Theoretical Analysis and Experimental Comparison of Graph Matching Algorithms for Database Filtering.	GbRPR	2003	DBLP DOI BibTeX RDF	database filtering, graph isomorphism, subgraph isomorphism
29	Anand Srivastav, Katja Wolf	Finding Dense Subgraphs with Semidefinite Programming.	APPROX	1998	DBLP DOI BibTeX RDF	Subgraph Problem, Approximation Algorithms, Randomized Algorithms, Semidefinite Programming