Sciweavers

6598 search results - page 103 / 1320
» Graph Theory with Applications
Sort
View
WWW
2011
ACM
14 years 11 months ago
Estimating sizes of social networks via biased sampling
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
Liran Katzir, Edo Liberty, Oren Somekh
FSTTCS
2007
Springer
15 years 10 months ago
Undirected Graphs of Entanglement 2
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 4 months ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
János Barát, Jirí Matousek, D...
DM
2008
114views more  DM 2008»
15 years 4 months ago
Subdivisions of graphs: A generalization of paths and cycles
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
Ch. Sobhan Babu, Ajit A. Diwan
EOR
2008
136views more  EOR 2008»
15 years 4 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...