Results 31 to 40 of about 3,659,863 (306)
New Bounds for Edge-Cover by Random Walk [PDF]
Combinatorics, probability & computing, 2011 We show that the expected time for a random walk on a (multi-)graph G to traverse all m edges of G, and return to its starting point, is at most 2m2; if each edge must be traversed in both directions, the bound is 3m2.
Agelos Georgakopoulos, Peter Winkler
semanticscholar +1 more source
Cover Time in Edge-Uniform Stochastically-Evolving Graphs
Algorithms, 2018 We define a general model of stochastically-evolving graphs, namely the edge-uniform stochastically-evolving graphs. In this model, each possible edge of an underlying general static graph evolves independently being either alive or dead at each discrete
Ioannis Lamprou +2 more
doaj +1 more source
A Novel Edge Cover based Graph Coloring Algorithm
, 2017 Graph Colouring Problem is a well-known NP-Hard problem. In Graph Colouring Problem (GCP) all vertices of any graph must be coloured in such a way that no two adjacent vertices are coloured with the same colour. In this paper, a new algorithm is proposed
H. Patidar, P. Chakrabarti
semanticscholar +1 more source
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2023 Spectral information and backscatter information are both exclusively important bases for land cover classification, and these two kinds of information are found in multispectral images and SAR images, respectively. Therefore, the fusion of complementary
Xunqiang Gong +5 more
doaj +1 more source
Parallel Computing Aspects in Improved Edge Cover Based Graph Coloring Algorithm
, 2017 Objective: To improve the Edge Cover based Graph Coloring Algorithm (ECGCA) using independent set by incorporating parallel computing aspects in algorithm. Finding optimum time complexity is one of the main objectives of this paper.
H. Patidar, P. Chakrabarti, Amrit Ghosh
semanticscholar +1 more source
Cover Time in Edge-Uniform Stochastically-Evolving Graphs [PDF]
Safety-critical Systems Symposium, 2017 We define a general model of stochastically-evolving graphs, namely the edge-uniform stochastically-evolving graphs. In this model, each possible edge of an underlying general static graph evolves independently being either alive or dead at each discrete
I. Lamprou, R. Martin, P. Spirakis
semanticscholar +1 more source
Edge effect on carabid assemblages along forest-grass transects [PDF]
Web Ecology, 2001 During 1997 and 1998, we have tested the edge-effect for carabids along oak-hornbeam forest-grass transects using pitfall traps in Hungary. Our hypothesis was that the diversity of carabids will be higher in the forest edge than in the forest interior ...
T. Magura, B. Tóthmérész, T. Molnár
doaj +1 more source
The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity
FEBS Letters, EarlyView.The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley +1 more source
Peptide‐based ligand antagonists block a Vibrio cholerae adhesin
FEBS Letters, EarlyView.The structure of a peptide‐binding domain of the Vibrio cholerae adhesin FrhA was solved by X‐ray crystallography, revealing how the inhibitory peptide AGYTD binds tightly at its Ca2+‐coordinated pocket. Structure‐guided design incorporating D‐amino acids enhanced binding affinity, providing a foundation for developing anti‐adhesion therapeutics ...
Mingyu Wang +9 more
wiley +1 more source
FEBS Letters, EarlyView.This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley +1 more source