Algorithms on Trees and Graphs

By G. Valiente. Springer Berlin Heidelberg, 2002

348 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Towards a practical k-dimensional Weisfeiler-Leman algorithm (2019, neutral): “Theorem 7 ([8, 32]).”
Feature Diagrams and Logics: There and Back Again (2007, background): “In general find ing maximal cliques is an NP-hard problem, as a graph can contain exponentially many of them [ 19, Section 6.1 ].”
Change Distilling:Tree Differencing for Fine-Grained Source Code Change Extraction (2007, neutral): “Sager et al. evaluated three different tree similarity algorithms for this purpose, derived from a bottom-up maximum common subtree isomorphism , a top-down maximum common subtree isomorphism , and an edit distance of two given trees , all three originally presented in [37].”
A survey of frequent subgraph mining algorithms (2012, background): “(v) if T is ordered, then the left-to-right ordering among the siblings in T should be preserved in ~ T (Valiente, 2002; Chi et al., 2004).”
The Algorithm Design Manual (2020, methodology): “Valiente [Val02] focuses on algorithms for tree and subgraph isomorphism.”
Frequent Subtree Mining – An Overview (2004, neutral): “A comprehensive introduction to the algorithms on unlabeled trees can be found in [41].”