|
|
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 |
76 | MohammadAli Safari, Mohammad R. Salavatipour |
A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 233-246, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
69 | Bingjun Sun, Prasenjit Mitra, C. Lee Giles |
Independent informative subgraph mining for graph information retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009, pp. 563-572, 2009, ACM, 978-1-60558-512-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers, pp. 29-42, 2008, Springer, 978-3-540-93979-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 13-15 November 2006, Arlington, VA, USA, pp. 169-178, 2006, IEEE Computer Society, 0-7695-2728-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
65 | Samir Khuller, Barna Saha |
On Finding Dense Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 597-608, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
62 | Zhaonian Zou, Jianzhong Li 0001, Hong Gao 0001, Shuo Zhang |
Frequent subgraph pattern mining on uncertain graph data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009, pp. 583-592, 2009, ACM, 978-1-60558-512-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
expected support, subgraph pattern, uncertain graph |
62 | Yao Wu, Louiqa Raschid |
ApproxRank: Estimating Rank for a Subgraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 54-65, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
62 | Changliang Wang, Lei Chen 0002 |
Continuous Subgraph Pattern Search over Graph Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 393-404, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
62 | Christian Schellewald |
A Bound for Non-subgraph Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GbRPR ![In: Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings, pp. 71-80, 2007, Springer, 978-3-540-72902-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
59 | Horst Bunke |
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 21(9), pp. 917-922, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIM ![In: Advances in Web-Age Information Management, 6th International Conference, WAIM 2005, Hangzhou, China, October 11-13, 2005, Proceedings, pp. 68-80, 2005, Springer, 3-540-29227-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Seventh Conference, Pune, India, December 17-19, 1987, Proceedings, pp. 79-94, 1987, Springer, 3-540-18625-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
58 | András Faragó |
A General Tractable Density Concept for Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(4), pp. 689-699, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 262-273, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Sebastian Wernicke 0001 |
Efficient Detection of Network Motifs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 3(4), pp. 347-359, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, 3-8 April 2006, Atlanta, GA, USA, pp. 38, 2006, IEEE Computer Society, 0-7695-2570-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
48 | Akiko Suzuki, Takeshi Tokuyama |
Dense subgraph problems with output-density conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(4), pp. 43:1-43:18, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, Combinatorial optimization, randomized algorithms, dense subgraph |
48 | Timo Poranen |
Heuristics for the Maximum Outerplanar Subgraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 11(1), pp. 59-88, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 117(1-4), pp. 175-190, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 17(1), pp. 57-76, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Skyline processing, Graph mining, Edge connectivity |
47 | Andrzej Lingas, Martin Wahlen |
On Exact Complexity of Subgraph Homeomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 256-261, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 58-67, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GbRPR ![In: Graph Based Representations in Pattern Recognition, 4th IAPR International Workshop, GbRPR 2003, York, UK, June 30 - July 2, 2003, Proceedings, pp. 130-141, 2003, Springer, 3-540-40452-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
47 | Wing Ning Li |
Convergent transfer subgraph characterization and computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (3) ![In: Proceedings of the 2003 International Symposium on Circuits and Systems, ISCAS 2003, Bangkok, Thailand, May 25-28, 2003, pp. 248-251, 2003, IEEE, 0-7803-7761-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 15(11), pp. 1101-1113, 1993. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
World Wide Web ![In: World Wide Web 11(4), pp. 485-510, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 160-169, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, July 25-28, 2010, pp. 793-802, 2010, ACM, 978-1-4503-0055-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAW ![In: Algorithms and Models for the Web-Graph, 6th International Workshop, WAW 2009, Barcelona, Spain, February 12-13, 2009. Proceedings, pp. 25-37, 2009, Springer, 978-3-540-95994-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Petra Mutzel |
A Polyhedral Approach to Planar Augmentation and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings, pp. 494-507, 1995, Springer, 3-540-60313-1. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 140-150, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
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) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 692-701, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 294-299, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 14(5), pp. 501-517, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKAW ![In: Knowledge Acquisition: Approaches, Algorithms and Applications, Pacific Rim Knowledge Acquisition Workshop, PKAW 2008, Hanoi, Vietnam, December 15-16, 2008, Revised Selected Papers, pp. 50-60, 2008, Springer, 978-3-642-01714-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(4), pp. 465-474, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 573-582, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Xiuzhen Huang, Jing Lai |
Maximum Common Subgraph: Upper Bound and Lower Bound Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMSCCS (1) ![In: Interdisciplinary and Multidisciplinary Research in Computer Science, IEEE CS Proceeding of the First International Multi-Symposium of Computer and Computational Sciences (IMSCCS|06), June 20-24, 2006, Zhejiang University, Hangzhou, China, Vol. 1, pp. 40-47, 2006, IEEE Computer Society, 0-7695-2581-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSPR/SPR ![In: Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshops SSPR 2002 and SPR 2002, Windsor, Ontario, Canada, August 6-9, 2002, Proceedings, pp. 123-132, 2002, Springer, 3-540-44011-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Robert Carr, R. Ravi 0001 |
A New Bound for the 2-Edge Connected Subgraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, pp. 112-125, 1998, Springer, 3-540-64590-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
40 | Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu |
A New Subgraph of Minimum Weight Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 266-274, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
40 | Viggo Kann |
On the Approximability of the Maximum Common Subgraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings, pp. 377-388, 1992, Springer, 3-540-55210-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Knowl. Discov. Data ![In: ACM Trans. Knowl. Discov. Data 1(3), pp. 12, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 362-374, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, July 25-28, 2010, pp. 633-642, 2010, ACM, 978-1-4503-0055-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(4), pp. 703-728, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(3), pp. 35:1-35:26, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 44(4), pp. 343-361, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 37(2), pp. 75-92, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings, pp. 59-70, 2002, Springer, 3-540-00225-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 299-308, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13-18 April 2008, Phoenix, AZ, USA, pp. 346-350, 2008, IEEE, 978-1-4244-2026-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko |
Approximating Minimum-Power Degree and Connectivity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 423-435, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Refael Hassin, Danny Segev |
Robust subgraphs for trees and paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(2), pp. 263-281, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithms, decomposition, spanning trees, robust optimization |
36 | Refael Hassin, Danny Segev |
Robust Subgraphs for Trees and Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings, pp. 51-63, 2004, Springer, 3-540-22339-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Béla Bollobás, Don Coppersmith, Michael Elkin |
Sparse distance preservers and additive spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 414-423, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
36 | John C. S. Lui |
Constructing Communication Subgraphs and Deriving an Optimal Synchronization Interval for Distributed Virtual Environment Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 13(5), pp. 778-792, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(9), pp. 1300-1302, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
34 | Jens Lischka, Holger Karl |
A virtual network mapping algorithm based on subgraph isomorphism detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VISA ![In: Proceedings of the 1st ACM SIGCOMM Workshop on Virtualized Infrastructure Systems and Architectures, VISA 2009, Barcelona, Spain, August 17, 2009, pp. 81-88, 2009, ACM, 978-1-60558-595-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PaCT ![In: Parallel Computing Technologies, 10th International Conference, PaCT 2009, Novosibirsk, Russia, August 31-September 4, 2009. Proceedings, pp. 257-268, 2009, Springer, 978-3-642-03274-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICEIS ![In: Enterprise Information Systems, 11th International Conference, ICEIS 2009, Milan, Italy, May 6-10, 2009. Proceedings, pp. 299-308, 2009, Springer, 978-3-642-01346-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Text classification, Graph mining, Frequent subgraph, Vietnamese |
34 | Michihiro Kuramochi, George Karypis |
GREW-A Scalable Frequent Subgraph Discovery Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 1-4 November 2004, Brighton, UK, pp. 439-442, 2004, IEEE Computer Society, 0-7695-2142-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 12(2), pp. 307-323, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 23-25 June 1999, Fremantle, Australia, pp. 350-355, 1999, IEEE Computer Society, 0-7695-0231-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 20(5), pp. 493-504, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 333-341, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 21(5), pp. 748-749, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Fan Chung Graham, Paul Horn, Linyuan Lu |
The Giant Component in a Random Subgraph of a Given Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAW ![In: Algorithms and Models for the Web-Graph, 6th International Workshop, WAW 2009, Barcelona, Spain, February 12-13, 2009. Proceedings, pp. 38-49, 2009, Springer, 978-3-540-95994-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | N. R. Aravind, C. R. Subramanian 0001 |
Forbidden Subgraph Colorings and the Oriented Chromatic Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 60-71, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Tamás Horváth 0001, Jan Ramon |
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML/PKDD (1) ![In: Machine Learning and Knowledge Discovery in Databases, European Conference, ECML/PKDD 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings, Part I, pp. 520-535, 2008, Springer, 978-3-540-87478-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Omid Amini, Ignasi Sau, Saket Saurabh 0001 |
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings, pp. 13-29, 2008, Springer, 978-3-540-79722-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Petteri Hintsanen |
The Most Reliable Subgraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Knowledge Discovery in Databases: PKDD 2007, 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings, pp. 471-478, 2007, Springer, 978-3-540-74975-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GbRPR ![In: Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings, pp. 351-360, 2007, Springer, 978-3-540-72902-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
On the Advantage over Random for Maximum Acyclic Subgraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 625-633, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Jiahai Wang |
A Hybrid of Particle Swarm Optimization and Hopfield Networks for Bipartite Subgraph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (3) ![In: Advances in Neural Networks - ISNN 2007, 4th International Symposium on Neural Networks, ISNN 2007, Nanjing, China, June 3-7, 2007, Proceedings, Part III, pp. 184-193, 2007, Springer, 978-3-540-72394-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Akiko Suzuki, Takeshi Tokuyama |
Dense Subgraph Problems with Output-Density Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 266-276, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Ensheng Yu, Xicheng Wang |
A Subgraph Isomorphism Algorithm Based on Hopfield Neural Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2004, International Symposium on Neural Networks, Dalian, China, August 19-21, 2004, Proceedings, Part I, pp. 436-441, 2004, Springer, 3-540-22841-1. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 261-272, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Mohammad Taghi Hajiaghayi, Naomi Nishimura |
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 305-318, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Matthew Dickerson, J. Mark Keil, Mark H. Montague |
A Large Subgraph of the Minimum Weight Triangulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 18(3), pp. 289-304, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Arvind Gupta, Naomi Nishimura |
Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 453-464, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, pp. 132-141, 1995, Springer, 3-540-60573-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
33 | Heiko Dörr |
Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 305-318, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 32(2), pp. 13, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, August 20-23, 2006, pp. 245-255, 2006, ACM, 1-59593-339-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 1572-1576, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, pp. 1211-1218, 2010, ACM, 978-1-4503-0072-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
genetic algorithm, dependency graph, malware detection, subgraph isomorphism |
29 | Yokesh Kumar, Prosenjit Gupta |
External memory layout vs. schematic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 14(2), pp. 30:1-30:20, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, ISSTA 2009, Chicago, IL, USA, July 19-23, 2009, pp. 141-152, 2009, ACM, 978-1-60558-338-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCO ![In: Modelling, Computation and Optimization in Information Systems and Management Sciences, Second International Conference, MCO 2008, Metz, France - Luxembourg, September 8-10, 2008. Proceedings, pp. 358-368, 2008, Springer, 978-3-540-87476-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SUTC ![In: IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC 2008), 11-13 June 2008, Taichung, Taiwan, pp. 394-399, 2008, IEEE Computer Society, 978-0-7695-3158-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(1), pp. 63-86, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCOPES ![In: Proceedings of the 10th International Workshop on Software and Compilers for Embedded Systems, Nice, France, April 20, 2007, pp. 101-110, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI (1) ![In: 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), October 29-31, 2007, Patras, Greece, Volume 1, pp. 346-349, 2007, IEEE Computer Society, 0-7695-3015-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 391-400, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGKDD Explor. ![In: SIGKDD Explor. 7(2), pp. 56-63, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 7(3), pp. 243-254, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004, San Diego, California, USA, March 27-31, 2004, pp. 308-315, 2004, ACM, 1-58113-755-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GbRPR ![In: Graph Based Representations in Pattern Recognition, 4th IAPR International Workshop, GbRPR 2003, York, UK, June 30 - July 2, 2003, Proceedings, pp. 118-129, 2003, Springer, 3-540-40452-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
database filtering, graph isomorphism, subgraph isomorphism |
29 | Anand Srivastav, Katja Wolf |
Finding Dense Subgraphs with Semidefinite Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings, pp. 181-191, 1998, Springer, 3-540-64736-8. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|