The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase k-Subgraph (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1968-1979 (15) 1980-1983 (16) 1984-1986 (18) 1987-1988 (16) 1989 (19) 1990 (19) 1991-1992 (38) 1993 (24) 1994 (32) 1995 (40) 1996 (31) 1997 (36) 1998 (39) 1999 (38) 2000 (45) 2001 (71) 2002 (66) 2003 (89) 2004 (110) 2005 (138) 2006 (137) 2007 (172) 2008 (190) 2009 (185) 2010 (104) 2011 (71) 2012 (110) 2013 (105) 2014 (124) 2015 (155) 2016 (146) 2017 (138) 2018 (171) 2019 (177) 2020 (165) 2021 (191) 2022 (264) 2023 (312) 2024 (76)
Publication types (Num. hits)
article(1818) book(1) incollection(34) inproceedings(1998) phdthesis(42)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1368 occurrences of 777 keywords

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