Sciweavers

990 search results - page 10 / 198
» Sub-Graphs of Complete Graph
Sort
View
JDA
2006
98views more  JDA 2006»
13 years 7 months ago
Completely connected clustered graphs
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
Sabine Cornelsen, Dorothea Wagner
JSYML
2010
107views more  JSYML 2010»
13 years 5 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
SDM
2011
SIAM
284views Data Mining» more  SDM 2011»
12 years 10 months ago
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
Myunghwan Kim 0002, Jure Leskovec
DM
2007
103views more  DM 2007»
13 years 7 months ago
Codes from the line graphs of complete multipartite graphs and PD-sets
The binary codes of the line graphs Lm(n) of the complete multipartite graphs Kn1,...,nm (ni = n for 1 ≤ i ≤ m) n ≥ 2, m ≥ 3 are examined, and PD-sets and s-PD-sets are fo...
Jennifer D. Key, P. Seneviratne
SOFSEM
2005
Springer
14 years 28 days ago
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
Radoslav Fulek, Hongmei He, Ondrej Sýkora, ...