Sciweavers

821 search results - page 5 / 165
» Addressing the Petersen graph
Sort
View
AMW
2011
14 years 1 months ago
SNQL: A Social Networks Query and Transformation Language
Abstract. Social Network (SN) data has become ubiquitous, demanding advanced and flexible means to represent, transform and query such data. In addition to the intrinsic challenge...
Mauro San Martín, Claudio Gutierrez, Peter ...
CL
2012
Springer
12 years 12 months ago
Object swapping challenges: An evaluation of imageSegment
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
Mariano Martinez Peck, Noury Bouraqadi, Sté...
INFOCOM
2012
IEEE
12 years 12 months ago
Sparse recovery with graph constraints: Fundamental limits and measurement construction
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
Meng Wang, Weiyu Xu, Enrique Mallada, Ao Tang
IV
2009
IEEE
128views Visualization» more  IV 2009»
15 years 4 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber
PCI
2005
Springer
15 years 3 months ago
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
Stavros D. Nikolopoulos, Leonidas Palios