Graph-based Criteria for Spectrum-Aware Clustering in Cognitive Radio Networks Milan Bradonji´ca , Loukas Lazosb,∗ a Los Alamos National Laboratory, Theoretical Division, and Center for Nonlinear Studies

First Page		Document Content
Date: 2011-05-23 22:55:03 Cluster analysis Complete bipartite graph Graph Bipartite dimension Graph theory Clique Bipartite graph		Graph-based Criteria for Spectrum-Aware Clustering in Cognitive Radio Networks Milan Bradonji´ca , Loukas Lazosb,∗ a Los Alamos National Laboratory, Theoretical Division, and Center for Nonlinear Studies Add to Reading List Source URL: www2.engr.arizona.edu Download Document from Source Website File Size: 1,78 MB Share Document on Facebook

	Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada DocID: 1rsEH - View Document
	On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡ DocID: 1rf09 - View Document
	Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office DocID: 1r8ab - View Document
	New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School DocID: 1qQA2 - View Document
	An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de DocID: 1qMfK - View Document