Sciweavers

384 search results - page 19 / 77
» On s-hamiltonian-connected line graphs
Sort
View
GD
2009
Springer
14 years 1 months ago
Geometric Simultaneous Embeddings of a Graph and a Matching
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
Sergio Cabello, Marc J. van Kreveld, Giuseppe Liot...
SG
2005
Springer
14 years 2 months ago
Picturing Causality - The Serendipitous Semiotics of Causal Graphs
Abstract. Bayesian nets (BNs) appeared in the 1980s as a solution to computational and representational problems encountered in knowledge representation of uncertain information. S...
Eric Neufeld, Sonje Kristtorn
FAC
2002
66views more  FAC 2002»
13 years 8 months ago
Shallow Linear Action Graphs and their Embeddings
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
James J. Leifer, Robin Milner
FAW
2010
Springer
232views Algorithms» more  FAW 2010»
13 years 9 months ago
Recognizing d-Interval Graphs and d-Track Interval Graphs
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
Minghui Jiang
ICDM
2008
IEEE
401views Data Mining» more  ICDM 2008»
14 years 3 months ago
Graph OLAP: Towards Online Analytical Processing on Graphs
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han, Phil...