Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,548,576 papers from all fields of science
Search
Sign In
Create Free Account
Biased graph
In mathematics, a biased graph is a graph with a list of distinguished circles (edge sets of simple cycles), such that if two circles in the list are…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Bicircular matroid
Dowling geometry
Gain graph
Graph (discrete mathematics)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
An Optimization Approach to Locally-Biased Graph Algorithms
K. Fountoulakis
,
D. Gleich
,
Michael W. Mahoney
Proceedings of the IEEE
2016
Corpus ID: 7909609
Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a large data graph. In some…
Expand
2016
2016
The excluded minors for the class of matroids that are graphic or bicircular lift
Rong-si Chen
Advances in Applied Mathematics
2016
Corpus ID: 119276112
2016
2016
Clones in 3-connected frame matroids
Jakayla R. Robbins
,
Daniel C. Slilaty
,
Xiangqian Zhou
Discrete Mathematics
2016
Corpus ID: 31443802
2016
2016
LP-branching algorithms based on biased graphs
Magnus Wahlström
ACM-SIAM Symposium on Discrete Algorithms
2016
Corpus ID: 51986258
We give a combinatorial condition for the existence of efficient, LP-based FPT algorithms for a broad class of graph-theoretical…
Expand
2013
2013
Toward a scalable refinement strategy for multilevel graph repartitioning
Sébastien Fourestier
,
F. Pellegrini
2013
Corpus ID: 16194952
Dynamic load balancing is a mandatory feature for parallel software whose workload evolves with time, such as solvers…
Expand
2012
2012
Algorithm of biased skeleton trim based on intersecting cortical model
Gao Shan
2012
Corpus ID: 63593969
In order to solve the problem of geometric distortion and low efficiency in the process of biased skeleton trim,a new algorithm…
Expand
2012
2012
Biased Expansions of Biased Graphs and Their Chromatic Polynomials
Lori Koban
2012
Corpus ID: 17102907
A biased graph is a graph with a distinguished set of circles, such that if two circles in the set are contained in a theta graph…
Expand
2002
2002
A bidirected generalisation of network matrices
Gautam M. Appa
,
B. Kotnyek
2002
Corpus ID: 13991937
We provide a new class of matrices, called binet matrices (de noted byB), which guarantee half-integral vertices for the…
Expand
1992
1992
Characterizing bias matroids
John G. Del Greco
Discrete Mathematics
1992
Corpus ID: 36341379
1992
1992
5. Concluding Remarks 4.3 Breakdown of Misprediction for the Gshare and Bi-mode Schemes 4.4 Go Benchmark Table 4: Numbers of Changes between Different Bias Classes for the History-indexed and Bi-mode…
T. Mudge
1992
Corpus ID: 14881554
schemes and configurations the misprediction for the WB class dominates—destructive aliasing is not the major concern. There is…
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