Sciweavers

3105 search results - page 124 / 621
» The Path-Packing Structure of Graphs
Sort
View
FCT
2009
Springer
15 years 7 months ago
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
Thomas Thierauf, Fabian Wagner
IPL
2007
101views more  IPL 2007»
15 years 3 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
WEBDB
2004
Springer
191views Database» more  WEBDB 2004»
15 years 8 months ago
Visualizing and Discovering Web Navigational Patterns
Web site structures are complex to analyze. Cross-referencing the web structure with navigational behaviour adds to the complexity of the analysis. However, this convoluted analys...
Jiyang Chen, Lisheng Sun, Osmar R. Zaïane, Ra...
DILS
2005
Springer
15 years 5 months ago
Assigning Unique Keys to Chemical Compounds for Data Integration: Some Interesting Counter Examples
Integrating data involving chemical structures is simplified when unique identifiers (UIDs) can be associated with chemical structures. For example, these identifiers can be use...
Greeshma Neglur, Robert L. Grossman, Bing Liu
109
Voted
ACL
2006
15 years 4 months ago
Polarized Unification Grammars
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects ...
Sylvain Kahane