Sciweavers

1402 search results - page 25 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
ECP
1997
Springer
103views Robotics» more  ECP 1997»
14 years 1 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler
DIS
2007
Springer
14 years 1 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
BIOCOMP
2007
13 years 11 months ago
Learning Node Replacement Graph Grammars in Metabolic Pathways
— This paper describes graph-based relational, unsupervised learning algorithm to infer node replacement graph grammar and its application to metabolic pathways. We search for fr...
Jacek P. Kukluk, Chang Hun You, Lawrence B. Holder...
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 9 months ago
On Graphs and Codes Preserved by Edge Local Complementation
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
Lars Eirik Danielsen, Matthew G. Parker, Constanza...
CIKM
2008
Springer
13 years 11 months ago
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
Barbara Poblete, Carlos Castillo, Aristides Gionis