Changes in / [1154:9b4503108cc0:1150:df2d4bf31fcb] in lemon-main
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/groups.dox
r1152 r1142 586 586 node labelings \f$l_1:V_1\longrightarrow L\f$ and \f$l_2:V_2\longrightarrow 587 587 L\f$ and we require that \f$l_1(u)=l_2(f(u))\f$ holds for all nodes \f$u \in 588 G _1\f$.588 G\f$. 589 589 590 590 */ -
doc/references.bib
r1153 r1142 357 357 358 358 @article{cordella2004sub, 359 author = {Cordella, Luigi P. and Foggia, Pasquale and Sansone, 359 title = {A (sub) graph isomorphism algorithm for matching 360 large graphs}, 361 author = {Cordella, Luigi P and Foggia, Pasquale and Sansone, 360 362 Carlo and Vento, Mario}, 361 title = {A (sub)graph isomorphism algorithm for matching 362 large graphs}, 363 journal = {IEEE Transactions on Pattern Analysis and Machine 364 Intelligence}, 365 volume = 26, 366 number = 10, 367 pages = {1367--1372}, 368 year = 2004 369 } 363 journal = {Pattern Analysis and Machine Intelligence, IEEE 364 Transactions on}, 365 volume = 26, 366 number = 10, 367 pages = {1367--1372}, 368 year = 2004, 369 publisher = {IEEE} 370 } -
lemon/vf2.h
r1152 r1144 429 429 void mappingType(Vf2MappingType m_type) { _mapping_type = m_type; } 430 430 431 ///Find sa mapping431 ///Find a mapping 432 432 433 433 ///It finds a mapping between from g1 into g2 according to the mapping
Note: See TracChangeset
for help on using the changeset viewer.