Some polishing
authorAlpar Juttner <alpar@cs.elte.hu>
Wed, 30 Nov 2016 23:20:34 +0100
changeset 25217340b8dec7
parent 24 bdf97dafabfb
child 27 497868c58d36
Some polishing
damecco.tex
     1.1 --- a/damecco.tex	Wed Nov 30 22:45:35 2016 +0100
     1.2 +++ b/damecco.tex	Wed Nov 30 23:20:34 2016 +0100
     1.3 @@ -255,12 +255,19 @@
     1.4  efficient cutting rules and determines a node order in which VF2 runs
     1.5  significantly faster on practical inputs.
     1.6  
     1.7 -This project was initiated and sponsored by QuantumBio
     1.8 -Inc.\cite{QUANTUMBIO} and the implementation --- along with a source
     1.9 -code --- has been published as a part of LEMON\cite{LEMON} open source
    1.10 -graph library.
    1.11 +The rest of the paper is structured as
    1.12 +follows. Section~\ref{sec:ProbStat} defines the exact problems to be
    1.13 +solved, Section~\ref{sec:VF2Alg} provides a description of VF2. Based
    1.14 +on that, Section~\ref{sec:VF2ppAlg} introduces VF2++. Some technical
    1.15 +details necessary for an efficient implementation are discussed in
    1.16 +Section~\ref{sec:VF2ppImpl}.  Finally, Section~\ref{sec:ExpRes}
    1.17 +provide a detailed experimental evaluation of VF2++ and its comparison
    1.18 +to the state-of-the-art algorithms.
    1.19  
    1.20 -Outline: Section~\ref{sec:ProbStat} defines the problems to be solved, Section~\ref{sec:VF2Alg} provides a description of VF2, Section~\ref{sec:VF2ppAlg} introduces VF2++, a new graph matching algorithm, Section~\ref{sec:VF2ppImpl} presents the details of an efficient implementation of VF2++, and Section~\ref{sec:ExpRes} compares VF2++ to a state of the art algorithm.
    1.21 +It must also be mentioned that the C++ implementations of the
    1.22 +algorithms have been made available for evaluation and use under an
    1.23 +open source license as a part of LEMON\cite{LEMON} open source graph
    1.24 +library.
    1.25  
    1.26  \section{Problem Statement}\label{sec:ProbStat}
    1.27  This section provides a formal description of the problems to be
    1.28 @@ -1375,6 +1382,15 @@
    1.29  faster than VF2 Plus, but it also has a practically linear behaviour both
    1.30  in the case of induced subgraph- and graph isomorphism.
    1.31  
    1.32 +%%%%%%%%%%%%%%%%
    1.33 +\section*{Acknowledgement} \label{sec:ack}
    1.34 +%%%%%%%%%%%%%%%%
    1.35 +This research project was initiated and sponsored by QuantumBio
    1.36 +Inc.\cite{QUANTUMBIO}.
    1.37 +
    1.38 +The authors were supported by the Hungarian Scientific Research Fund -
    1.39 +OTKA, K109240 and by the J\'anos Bolyai Research Fellowship program of
    1.40 +the Hungarian Academy of Sciences.
    1.41  
    1.42  
    1.43  %% The Appendices part is started with the command \appendix;