Sciweavers

1986 search results - page 103 / 398
» Path Separability of Graphs
Sort
View
ALT
2007
Springer
14 years 5 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
STACS
2004
Springer
14 years 2 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
AUSAI
2003
Springer
14 years 2 months ago
Information Extraction via Path Merging
Abstract. In this paper, we describe a new approach to information extraction that neatly integrates top-down hypothesis driven information with bottom-up data driven information. ...
Robert Dale, Cécile Paris, Marc Tilbrook
JCIT
2010
126views more  JCIT 2010»
13 years 3 months ago
Development of Low Cost Message Delivery Path for Mobile Agent Communication
The location management ability of a mobile agent system which enables a mobile agent to interact with others accurately by message passing beyond doubts stands important for the ...
Tzong I Wang, Ting-Yuan Yeh
ADHOCNOW
2005
Springer
14 years 2 months ago
Performance Analysis of the Hierarchical Layer Graph for Wireless Networks
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
Stefan Rührup, Christian Schindelhauer, Klaus...