2503 search results - page 115 / 501 » A study of 3-arc graphs |
131
Voted
TCS
2008
15 years 6 months ago
2008
We investigate the structure of graphs in the Caucal hierarchy. We provide criteria concerning the degree of vertices or the length of paths which can be used to show that a given ...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
159
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
187
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
273
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...