34 results on '"Marino, Andrea"'
Search Results
2. On Computing Optimal Temporal Branchings
3. On Computing Large Temporal (Unilateral) Connected Components
4. Interspecific Competition Between Guanacos and Livestock and Their Relative Impact on Patagonian Rangelands: Evidence, Knowledge Gaps, and Future Directions
5. Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
6. Edge-Disjoint Branchings in Temporal Graphs
7. Degrees of Separation and Diameter in Large Graphs
8. The Graph Structure of Bitcoin
9. Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs
10. Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search
11. Efficient Algorithms for Listing k Disjoint st-Paths in Graphs
12. Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts
13. An analysis of the Bitcoin users graph: inferring unusual behaviours
14. Listing Maximal Independent Sets with Minimal Space and Bounded Delay
15. A Fast Algorithm for Large Common Connected Induced Subgraphs
16. Enumerating Cycles and (s, t)-Paths in Undirected Graphs
17. Enumerating Diametral and Radial Vertices and Computing Diameter and Radius of a Graph
18. Enumerating Bubbles: Listing Pairs of Vertex Disjoint Paths
19. Telling Stories: Enumerating Maximal Directed Acyclic Graphs with Constrained Set of Sources and Targets
20. Introduction
21. An Application: Biological Graph Analysis
22. Enumeration Algorithms
23. Listing Acyclic Orientations of Graphs with Single and Multiple Sources
24. Directing Road Networks by Listing Strong Orientations
25. Enumerating Cyclic Orientations of a Graph
26. On Computing the Hyperbolicity of Real-World Graphs
27. On the Solvability of the Six Degrees of Kevin Bacon Game : A Faster Graph Diameter and Radius Computation Method
28. Telling Stories Fast : Via Linear-Time Delay Pitch Enumeration
29. Efficient Bubble Enumeration in Directed Graphs
30. On Computing the Diameter of Real-World Directed (Weighted) Graphs
31. A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs
32. Finding the Diameter in Real-World Graphs : Experimentally Turning a Lower Bound into an Upper Bound
33. Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications
34. Conclusions
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.