Search results for "05C12"

Found 9 publication records. Showing 9 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
26	Jean-Baptiste Angelelli, Anaïs Baudot, Marie-Christine Brun, Alain Guénoche	Two local dissimilarity measures for weighted graphs with application to protein interaction networks.	Adv. Data Anal. Classif.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C12, 90C59, 90C35
26	Lucile Denoeud	Transfer distance between partitions.	Adv. Data Anal. Classif.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03E02, 05A18, 05C12, 62G15, 62G30, 05C35, 05D99
26	Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton	An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces.	COCOA	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification codes 05C05, 05C12, 92B10
26	Wesley Pegden	Distance Sequences In Locally Infinite Vertex-Transitive Digraphs.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C12
26	Anupam Gupta 0001, Ilan Newman, Yuri Rabinovich, Alistair Sinclair	Cuts, Trees and l1-Embeddings of Graphs.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C12, 90C27, 68R10, 05C85
26	Andrew Dabrowski, Lawrence S. Moss	The Johnson Graphs Satisfy a Distance Extension Property.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C12, 05C80
26	László Pyber	A Bound for the Diameter of Distance-Regular Graphs.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05E30, 05C12
26	Clemens Heuberger	Minimal Expansions in Redundant Number Systems and Shortest Paths in Graphs.	Computing	1999	DBLP DOI BibTeX RDF	AMS Subject Classifications: 11A63, 05C12, 68R10
26	Paul Erdös, András Gyárfás, Miklós Ruszinkó	How to decrease the diameter of triangle-free graphs.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C12, 05C35

Displaying result #1 - #9 of 9 (100 per page; Change: )