Sciweavers

1883 search results - page 216 / 377
» Ordered theta graphs
Sort
View
ENTCS
2002
90views more  ENTCS 2002»
13 years 8 months ago
Specifying Graph-like Diagrams with DIAGEN
ended abstract demonstrates that creating editors and environments for visual languages becomes considerably easier when restricting the class of visual languages. The presented a...
Mark Minas
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
13 years 8 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
MP
2010
128views more  MP 2010»
13 years 6 months ago
Copositivity cuts for improving SDP bounds on the clique number
Adding cuts based on copositive matrices, we propose to improve Lov´asz’ bound θ on the clique number and its tightening θ introduced by McEliece, Rodemich, Rumsey, and Schri...
Immanuel M. Bomze, Florian Frommlet, Marco Locatel...
ECCV
2002
Springer
14 years 10 months ago
Shock-Based Indexing into Large Shape Databases
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
Thomas B. Sebastian, Philip N. Klein, Benjamin B. ...
WWW
2005
ACM
14 years 8 months ago
PageRank as a function of the damping factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
Paolo Boldi, Massimo Santini, Sebastiano Vigna