Sciweavers

1395 search results - page 50 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
14 years 9 months ago
Anonymizing bipartite graph data using safe groupings
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
Graham Cormode, Divesh Srivastava, Ting Yu, Qing Z...
JGAA
2010
128views more  JGAA 2010»
14 years 8 months ago
Intersection Graphs of Pseudosegments: Chordal Graphs
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
Cornelia Dangelmayr, Stefan Felsner, William T. Tr...
IPPS
2006
IEEE
15 years 3 months ago
Self-stabilizing distributed algorithms for graph alliances
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorith...
Zhenyu Xu, Pradip K. Srimani
FAW
2010
Springer
217views Algorithms» more  FAW 2010»
14 years 8 months ago
Path Separability of Graphs
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
Emilie Diot, Cyril Gavoille
ISAAC
2010
Springer
266views Algorithms» more  ISAAC 2010»
14 years 7 months ago
Structural and Complexity Aspects of Line Systems of Graphs
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
Jozef Jirásek, Pavel Klavík