Sciweavers

361 search results - page 3 / 73
» Relaxed Gabriel Graphs
Sort
View
IPL
2007
130views more  IPL 2007»
13 years 7 months ago
Linear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
Ryuhei Uehara, Gabriel Valiente
COMBINATORICS
2006
119views more  COMBINATORICS 2006»
13 years 7 months ago
Relaxations of Ore's Condition on Cycles
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
Ahmed Ainouche
IADIS
2004
13 years 8 months ago
Mining Relaxed Graph Properties in Internet
Many real world datasets are represented in the form of graphs. The classical graph properties found in the data, like cliques or independent sets, can reveal new interesting info...
Wilhelmiina Hämäläinen, Hannu Toivo...
IOR
2011
175views more  IOR 2011»
13 years 2 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....