Sciweavers

191 search results - page 9 / 39
» Intersections of graphs
Sort
View
DCG
2008
93views more  DCG 2008»
13 years 7 months ago
Odd Crossing Number and Crossing Number Are Not the Same
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
ENTCS
2002
118views more  ENTCS 2002»
13 years 7 months ago
Rank 2 Types for Term Graph Rewriting
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...
Steffen van Bakel
DM
2006
54views more  DM 2006»
13 years 7 months ago
A note on interconnecting matchings in graphs
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
Tomás Kaiser
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
13 years 11 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...
CONEXT
2009
ACM
13 years 8 months ago
StarClique: guaranteeing user privacy in social networks against intersection attacks
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
Krishna P. N. Puttaswamy, Alessandra Sala, Ben Y. ...