Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,295,215 papers from all fields of science
Search
Sign In
Create Free Account
Undirected Graph
A graph in which the edges are not ordered, and therefore, are symmetric.
National Institutes of Health
Create Alert
Alert
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A Secure Scheme for Distributed Consensus Estimation against Data Falsification in Heterogeneous Wireless Sensor Networks
Shichao Mi
,
Hui Han
,
Cailian Chen
,
Jianshu Yan
,
X. Guan
Italian National Conference on Sensors
2016
Corpus ID: 1613355
Heterogeneous wireless sensor networks (HWSNs) can achieve more tasks and prolong the network lifetime. However, they are…
Expand
2013
2013
Learning a Bayesian network model for predicting wildfire behavior
Kilian Zwirglmaier
,
P. Papakosta
,
D. Štraub
2013
Corpus ID: 33927394
A Bayesian network (BN) model for predicting wildfire spreading was developed. From the available indicator variables related to…
Expand
2012
2012
Residue centrality in alpha helical polytopic transmembrane protein structures.
I. Arnold Emerson
,
K. Gothandam
Journal of Theoretical Biology
2012
Corpus ID: 5209255
2006
2006
Modeling and Simulation Study of the Propagation and Defense of Internet Email Worm
C. Zou
,
D. Towsley
,
W. Gong
2006
Corpus ID: 17070432
As many people rely on email communications for business and everyday life, Internet email worms constitute one of the major…
Expand
2005
2005
Solving maximum cut problems in the Adleman-Lipton model.
Dongmei Xiao
,
Wenxia Li
,
Zhizhou Zhang
,
Lin He
Bio Systems
2005
Corpus ID: 26458025
Highly Cited
2001
Highly Cited
2001
Refined Search Tree Technique for Dominating Set on Planar Graphs 1
J. Alber
,
H. Fernau
,
R. Niedermeier
,
Hongbing Fan
,
M. Fellows
,
Frances A. Rosamond
2001
Corpus ID: 3978714
We establish a refined search tree technique for the parameterized Dominating Set problem on planar graphs. Here, we are given an…
Expand
2001
2001
Leafy spanning trees in hypercubes
W. Duckworth
,
P. Dunne
,
A. Gibbons
,
M. Zito
Applied Mathematics Letters
2001
Corpus ID: 11697933
Highly Cited
1982
Highly Cited
1982
Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph
U. Abel
,
R. Bicker
IEEE Transactions on Reliability
1982
Corpus ID: 36282553
An efficient enumeration algorithm generates all minimal cut-sets separating a special vertex pair in an undirected graph. The…
Expand
1980
1980
The Dimension of Finite and Infinite Comparability Graphs
J. Arditti
,
H. A. Jung
1980
Corpus ID: 18542979
1. Basic definitions and aim of the paper Let Kbe a set, finite or infinite. A simple directed graph P = {V, U) is said to be…
Expand
1970
1970
Realization of modified cut-set matrix and applications
P. Reddy
,
V. Murti
,
K. Thulasiraman
1970
Corpus ID: 16721677
The concepts of network of departure and padding n-port network are defined and certain important properties of these networks…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE