Bipartite dimension

Results: 7



#Item
1Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗   arXiv:1108.4675v1 [cs.SI] 23 Aug 2011

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗ arXiv:1108.4675v1 [cs.SI] 23 Aug 2011

Add to Reading List

Source URL: www.dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:56
2Jump Number of Two-Directional Orthogonal Ray Graphs Jose´ A. Soto1 1 Department 2 Operations

Jump Number of Two-Directional Orthogonal Ray Graphs Jose´ A. Soto1 1 Department 2 Operations

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2013-08-08 17:44:22
3Graph-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

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

Language: English - Date: 2011-05-23 22:55:03
4ARC MINIMIZATION IN FINITE STATE DECODING GRAPHS WITH CROSS-WORD ACOUSTIC CONTEXT G. Zweig, G. Saon F. Yvon

ARC MINIMIZATION IN FINITE STATE DECODING GRAPHS WITH CROSS-WORD ACOUSTIC CONTEXT G. Zweig, G. Saon F. Yvon

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2002-08-23 18:15:24
5Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi

Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2012-06-27 11:58:26
6On Set Intersection Representations of Graphs ∗ S. Jukna †‡ Abstract The intersection dimension of a bipartite graph with respect to a type L is the smallest number t for which it is possible to assign sets Ax ⊆

On Set Intersection Representations of Graphs ∗ S. Jukna †‡ Abstract The intersection dimension of a bipartite graph with respect to a type L is the smallest number t for which it is possible to assign sets Ax ⊆

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2008-10-14 11:56:16
7Atlantic Electronic Journal of Mathematics Volume 1, Number 1, Summer 2006

Atlantic Electronic Journal of Mathematics Volume 1, Number 1, Summer 2006

Add to Reading List

Source URL: euclid.trentu.ca

Language: English - Date: 2012-09-26 12:29:14