Results 91 to 100 of about 206,716 (316)
Graph Homomorphism Revisited for Graph Matching
, 2010 In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
Efficient Point-to-Point Resistance Distance Queries in Large Graphs
, 2023 We describe a method to efficiently compute point-to-point resistance distances in a graph, which are notoriously difficult to compute from the raw graph data. Our method is based on a relatively compact hierarchical data structure which “compresses” the
Hormann, Kai +3 more
core +1 more source
Molecular Oncology, EarlyView.BCL9 and BCL9L drive bladder cancer progression by enhancing β‐catenin signaling, promoting proliferation, migration, invasion, and organoid growth. Genetic depletion of BCL9(L) suppresses malignant phenotypes, while pharmacological disruption of the β‐catenin/BCL9(L) complex with ZW4864 inhibits canonical Wnt signaling and tumor‐associated cellular ...
Roland Kotolloshi +11 more
wiley +1 more source
Action Graphs for Performing Goal Recognition Design on Human-Inhabited Environments
Sensors, 2019 Goal recognition is an important component of many context-aware and smart environment services; however, a person’s goal often cannot be determined until their plan nears completion.
Helen Harman, Pieter Simoens
doaj +1 more source
Algorithms for streaming graphs [PDF]
, 2009 An algorithm solving a graph problem is usually expected to have fast random access to the input graph G and a working memory that is able to store G completely. These powerful assumptions are put in question by massive graphs that exceed common working memories and that can only be stored on disks or even tapes.
openaire +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
Heuristic Search for the Analysis of Graph Transition Systems
, 2006 Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution.
Lluch-Lafuente, Alberto +5 more
core +1 more source
Using Games to Investigate Movement for Graph Comprehension [PDF]
, 2004 We describe the results of empirical investigations that explore the effectiveness of moving graph diagrams to improve the comprehension of their structure.
Bovey, John D. +5 more
core +1 more source
Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs
IEEE Access, 2020 The notion of k-truss has been introduced a decade ago in social network analysis and security for community detection, as a form of cohesive subgraphs less stringent than a clique (set of pairwise linked nodes), and more selective than a k-core (induced
Alessio Conte +4 more
doaj +1 more source