Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Graph matching")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1207

  • Page / 49
Export

Selection :

  • and

Graph similarity scoring and matchingZAGER, Laura A; VERGHESE, George C.Applied mathematics letters. 2008, Vol 21, Num 1, pp 86-94, issn 0893-9659, 9 p.Article

Matchings in graphs of size ℵAHARONI, R.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 1, pp 113-117, issn 0095-8956Article

Matchings in pentagonal chainsFARRELL, E. J; WAHID, S. A.Discrete applied mathematics. 1984, Vol 8, Num 1, pp 31-40, issn 0166-218XArticle

On an obstruction for perfect matchingsAHARONI, R.Combinatorica (Print). 1984, Vol 4, Num 1, pp 1-6, issn 0209-9683Article

On certain classes of fractional matchingsMÜHLBACHER, J. R; STEINPARZ, F. X; TINHOFER, G et al.Discrete applied mathematics. 1984, Vol 9, Num 3, pp 235-244, issn 0166-218XArticle

A generic framework for median graph computation based on a recursive embedding approachFERRER, M; KARATZAS, D; VALVENY, E et al.Computer vision and image understanding (Print). 2011, Vol 115, Num 7, pp 919-928, issn 1077-3142, 10 p.Article

Median graphs: A genetic approach based on new theoretical propertiesFERRER, M; VALVENY, E; SERRATOSA, F et al.Pattern recognition. 2009, Vol 42, Num 9, pp 2003-2012, issn 0031-3203, 10 p.Article

k-Best constrained bases of a matroidLECLERC, M; RENDL, F.Zeitschrift für Operations Research. 1990, Vol 34, Num 2, pp 79-89, issn 0373-790X, 11 p.Article

Efficient subgraph matching using topological node feature constraintsDAHM, Nicholas; BUNKE, Horst; CAELLI, Terry et al.Pattern recognition. 2015, Vol 48, Num 2, pp 317-330, issn 0031-3203, 14 p.Conference Paper

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing ProblemsFELLOWS, M. R; KNAUER, C; NISHIMURA, N et al.Algorithmica. 2008, Vol 52, Num 2, pp 167-176, issn 0178-4617, 10 p.Article

Fractional matchings and covers in infinite hypergraphsAHARONI, R.Combinatorica (Print). 1985, Vol 5, Num 3, pp 181-184, issn 0209-9683Article

Slender graphsHERTZ, A.Journal of combinatorial theory. Series B. 1989, Vol 47, Num 2, pp 231-236, issn 0095-8956, 6 p.Article

An efficient algorithm for the bipartite matching problemCARRARESI, P; SODINI, C.European journal of operational research. 1986, Vol 23, Num 1, pp 86-93, issn 0377-2217Article

A polynomial algorithm for b-matchings: an alternative approachANSTEE, R. P.Information processing letters. 1987, Vol 24, Num 3, pp 153-157, issn 0020-0190Article

Ear-decompositions of matching-covered graphsLOVASZ, L.Combinatorica (Print). 1983, Vol 3, Num 1, pp 105-117, issn 0209-9683Article

A note on matching and separabilityCOOK, W.Discrete applied mathematics. 1985, Vol 10, Num 2, pp 203-209, issn 0166-218XArticle

A distance problem in graph theoryANDREATTA, A; SCOTTI, F.Rendiconti - Istituto lombardo. Accademia di scienze e lettere. A. Scienze matematiche e applicazioni. 1991, Vol 125, Num 2, pp 219-228, issn 0392-9523Article

A compactness theorem for perfect matchings in matroidsKOMJATH, P; MILNER, E. C; POLAT, N et al.Journal of combinatorial theory. Series B. 1988, Vol 44, Num 3, pp 253-262, issn 0095-8956Article

A generalization of Tutte's 1-factor theorem to countable graphsAHARONI, R.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 3, pp 199-209, issn 0095-8956Article

A perfect matching algorithm for sparse bipartite graphsTOCZYLOWSKI, E.Discrete applied mathematics. 1984, Vol 9, Num 3, pp 263-268, issn 0166-218XArticle

On the theory of matching equivalent graphs and rook equivalent chessboardsFARRELL, E. J.Journal of the Franklin Institute. 1992, Vol 329, Num 1, pp 45-64, issn 0016-0032Article

Induced matchings in bipartite graphsFAUDREE, R. J; GYARFAS, A; SCHELP, R. H et al.Discrete mathematics. 1989, Vol 78, Num 1-2, pp 83-87, issn 0012-365X, 5 p.Article

On operator and formal sum methods for graph enumeration problemsLIU, C. J; YUTZE CHOW.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 3, pp 384-406, issn 0196-5212Article

Non-bayesian Graph Matching without explicit compatibility calculationsVAN WYK, Barend Jacobus; VAN WYK, Michaël Antonie.Lecture notes in computer science. 2002, pp 74-82, issn 0302-9743, isbn 3-540-44011-9, 9 p.Conference Paper

Spectral radius of graphs with given matching numberLIHUA FENG; GUIHAI YU; ZHANG, Xiao-Dong et al.Linear algebra and its applications. 2007, Vol 422, Num 1, pp 133-138, issn 0024-3795, 6 p.Article

  • Page / 49