Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Reachability is a fundamental problem on large-scale networks emerging nowadays in various application domains, such as social networks, communication networks, biological networks, road networks, etc. It has been studied extensively. Hover, little existing work has studied reachability with realistic constraints imposed on graphs with real-valued edge or node ights. In fact, such ights are very common in many real-world networks, for example, the bandwidth of a link in communication networks, the reliability of an interaction beten two proteins in PPI networks, and the handling capacity of a warehouse/storage point in a distribution network. ,  formalize a new yet important reachability query in ighted undirected graphs, called ight constraint reachability (WCR) query that asks: is there a path beten nodes $$a$$ and $$b$$ , on which each real-valued edge (or node) ight satisfies a range constraint.  discover an interesting property of WCR, based on which,  design a novel edge-based index structure to ansr the WCR query in $$O(1)$$ time. Furthermore,  consider the case when the index cannot entirely fit in the memory, which can be very common for emerging massive networks. An I/O-efficient index is proposed, which provides constant I/O (precisely four I/Os) query time with $$O(|V|\log |V|)$$ disk-based index size. Extensive experimental studies on both real and synthetic datasets demonstrate the efficiency and scalability of our solutions in ansring the WCR query.
['Miao Qiao', 'Hong Cheng', 'Lu Qin', 'Jeffrey Xu Yu', 'Philip S. Yu', 'Lijun Chang']
I am writing a research paper on a idea Computing weight constraint reachability in large networks
[{"from": "human", "value": "I am writing a research paper on a idea Computing weight constraint reachability in large networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Reachability is a fundamental problem on large-scale networks emerging nowadays in various application domains, such as social networks, communication networks, biological networks, road networks, etc. It has been studied extensively. Hover, little existing work has studied reachability with realistic constraints imposed on graphs with real-valued edge or node ights. In fact, such ights are very common in many real-world networks, for example, the bandwidth of a link in communication networks, the reliability of an interaction beten two proteins in PPI networks, and the handling capacity of a warehouse/storage point in a distribution network. ,  formalize a new yet important reachability query in ighted undirected graphs, called ight constraint reachability (WCR) query that asks: is there a path beten nodes $$a$$ and $$b$$ , on which each real-valued edge (or node) ight satisfies a range constraint.  discover an interesting property of WCR, based on which,  design a novel edge-based index structure to ansr the WCR query in $$O(1)$$ time. Furthermore,  consider the case when the index cannot entirely fit in the memory, which can be very common for emerging massive networks. An I/O-efficient index is proposed, which provides constant I/O (precisely four I/Os) query time with $$O(|V|\\log |V|)$$ disk-based index size. Extensive experimental studies on both real and synthetic datasets demonstrate the efficiency and scalability of our solutions in ansring the WCR query."}]