Carlo Sansone - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged graph-rewriting

Benchmarking graph-based clustering algorithmsPasquale Foggia, Gennaro Percannella, Carlo Sansone, Mario Vento. ivc, 27(7):979-988, 2009. [doi]

Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, ProceedingsRalf Treinen, editor, Volume 5595 of Lecture Notes in Computer Science, Springer, 2009. [doi]

A Graph-Based Algorithm for Cluster DetectionPasquale Foggia, Gennaro Percannella, Carlo Sansone, Mario Vento. ijprai, 22(5):843-860, 2008. [doi]

Bandwidth of the corona of two graphsToru Kojima. DM, 308(17):3770-3781, 2008. [doi]

How and Why Pattern Recognition and Computer Vision Applications Use GraphsDonatello Conte, Pasquale Foggia, Carlo Sansone, Mario Vento. In Abraham Kandel, Horst Bunke, Mark Last, editors, Applied Graph Theory in Computer Vision and Pattern Recognition. Volume 52 of Studies in Computational Intelligence, pages 85-135, Springer, 2007. [doi]

A Graph-Based Clustering Method and Its ApplicationsPasquale Foggia, Gennaro Percannella, Carlo Sansone, Mario Vento. bvai 2007: 277-287 [doi]

Assessing the Performance of a Graph-Based Clustering AlgorithmPasquale Foggia, Gennaro Percannella, Carlo Sansone, Mario Vento. gbrpr 2007: 215-227 [doi]

Dynamic Multilevel Graph VisualizationTodd L. Veldhuizen. corr, abs/0712.1549, 2007. [doi]

Graphing Kendall s tauMatthew K. Davis, Gemai Chen. csda, 51(5):2375-2378, 2007. [doi]

A Graph-Based Method for Detecting and Classifying Clusters in Mammographic ImagesPasquale Foggia, M. Guerriero, Gennaro Percannella, Carlo Sansone, Francesco Tufano, Mario Vento. gacm 2006: 484-493 [doi]

Which claw-free graphs are strongly perfect?Hui-Yu Wang. DM, 306(19-20):2602-2629, 2006. [doi]

A Graph-Theoretical Clustering Method for Detecting Clusters of Micro-Calcifications in Mammographic ImagesLuigi P. Cordella, Gennaro Percannella, Carlo Sansone, Mario Vento. cbms 2005: 15-20 [doi]

Aspect graphs for three-dimensional object recognition machine vision systemsTatiana Tambouratzis, Michael J. Wright. ijis, 20(1):47-72, 2005. [doi]

A (Sub)Graph Isomorphism Algorithm for Matching Large GraphsLuigi P. Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento. pami, 26(10):1367-1372, 2004. [doi]

Thirty Years Of Graph Matching In Pattern RecognitionDonatello Conte, Pasquale Foggia, Carlo Sansone, Mario Vento. ijprai, 18(3):265-298, 2004. [doi]

Finding hidden independent sets in interval graphsTCS, 310(1-3):287-307, 2004. [doi]

Superfluous edges and exponential expansions of De Bruijn and Kautz graphsEduardo A. Canale, José Gómez. DAM, 138(3):303-331, 2004. [doi]

A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled GraphsDonatello Conte, C. Guidobaldi, Carlo Sansone. gbrpr 2003: 130-141 [doi]

Graph matching applications in pattern recognition and image processingDonatello Conte, Pasquale Foggia, Carlo Sansone, Mario Vento. icip 2003: 21-24

A large database of graphs and its use for benchmarking graph isomorphism algorithmsMassimo De Santo, Pasquale Foggia, Carlo Sansone, Mario Vento. prl, 24(8):1067-1079, 2003. [doi]

Lower Bounds for General Graph-Driven Read-Once Parity Branching ProgramsHenrik Brosenne, Matthias Homeister, Stephan Waack. mfcs 2003: 290-299 [doi]

Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching ProgramsMatthias Homeister. eccc, (068), 2003. [doi]

A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected GraphsHorst Bunke, Pasquale Foggia, C. Guidobaldi, Carlo Sansone, Mario Vento. gacm 2002: 123-132 [doi]

Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDsHenrik Brosenne, Matthias Homeister, Stephan Waack. ita, 36(3):229-247, 2002. [doi]

Neighbourhood Graphs of Cayley Graphs for Finitely-generated GroupsMarkus Neuhauser. ejc, 23(6):733-740, 2002. [doi]

Drawing Graphs on the TorusWilliam Kocay, Daniel Neilson, Ryan Szypowski. arscom, 59, 2001.

Graph-Driven Free Parity BDDs: Algorithms and Lower BoundsHenrik Brosenne, Matthias Homeister, Stephan Waack. mfcs 2001: 212-223 [doi]

Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, ProceedingsJoe Marks, editor, Volume 1984 of Lecture Notes in Computer Science, Springer, 2001.

Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency GraphsJosep Lladós, Enric Martí, Juan José Villanueva. pami, 23(10):1137-1143, 2001. [doi]

Solving the Word Problem for Two Classes of Non-associative Rings by RewritingAlfred Widiger. JSC, 32(3):291-301, 2001.

Fast Graph Matching for Detecting CAD Image ComponentsLuigi P. Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento. icpr 2000: 6034-6037 [doi]

Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, ProceedingsLeo Bachmair, editor, Volume 1833 of Lecture Notes in Computer Science, Springer, 2000.

Performance Evaluation of the VF Graph Matching AlgorithmLuigi P. Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento. iciap 1999: 1172-1177 [doi]

Embedding Graphs into a Three Page Book with ::::O::::(::::m:::: log ::::n::::) Crossings of Edges over the SpineHikoe Enomoto, Miki Shimabara Miyauchi. siamdm, 12(3):337-341, 1999. [doi]

Tenth Spectral Moment for Molecular Graphs of PhenylenesSvetlana Markovic. jcisd, 39(4):654-658, 1999. [doi]

Neighborhood conditions for balanced independent sets in bipartite graphsDenise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz. DM, 181(1-3):31-36, 1998. [doi]

Within ARM s Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite SystemsWan Fokkink, Jasper Kamperman, Pum Walters. TOPLAS, 20(3):679-706, 1998. [doi]

on Global Dynamics of Optimal Graph ReductionJulia L. Lawall, Harry G. Mairson. ICFP 1997: 188-195

Graph Drawing, Symposium on Graph Drawing, GD 95, Passau, Germany, September 20-22, 1995, ProceedingsFranz-Josef Brandenburg, editor, Volume 1027 of Lecture Notes in Computer Science, Springer, 1996.

On m-centers in P::t::-free graphsOdile Favaron, Jean-Luc Fouquet. DM, 125(1-3):147-152, 1994. [doi]

A probabilistic upper bound for the edge identification complexity of graphsEberhard Triesch. DM, 125(1-3):371-376, 1994. [doi]

Primitivity and Ends of GraphsRögnvaldur G. Möller. combinatorica, 14(4):477-484, 1994.

Graph TypesNils Klarlund, Michael I. Schwartzbach. POPL 1993: 196-205

Correspondence between Sylvester, Petersen, Hilbert and Klein on invariants and the factorisation of graphs 1889-1891Gert Sabidussi. DM, 100(1-3):99-155, 1992. [doi]

International Conference on Rewriting Techniques and ApplicationsRonald V. Book, editor, Volume 488 of Lecture Notes in Computer Science, Springer, Como, Italy, April 1991. [doi]

The HDG-Machine: A Highly Distributed Graph-Reducer for a Transputer NetworkHugh Kingdon, David R. Lester, Geoffrey L. Burn. cj, 34(4):290-301, 1991.

Inequalities between the domination number and the chromatic number of a graphDieter Gernert. DM, 76(2):151-153, 1989. [doi]

On the number of induced subgraphs of a random graphHiroshi Maehara. DM, 64(2-3):309-312, 1987. [doi]

When m vertices in a k-connected graph cannot be walked round along a simple cycleAlexander K. Kelmans, M. V. Lomonosov. DM, 38(2-3):317-322, 1982. [doi]

Twofold Triple Systems and Graph ImbeddingsSeth R. Alpert. JCT, 18(1):101-107, 1975.

runs on WebDSL