Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,161,868 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.
2018
2018
A Ramsey Theorem for Biased Graphs
P. Nelson
,
Sophia Park
SIAM Journal on Discrete Mathematics
2018
Corpus ID: 119658986
A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of…
Expand
2017
2017
The Projective Planarity Question for Matroids of $3$-Nets and Biased Graphs
Rigoberto Fl'orez
,
T. Zaslavsky
2017
Corpus ID: 119179574
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph…
Expand
2014
2014
Biased Graph
Encyclopedia of Social Network Analysis and…
2014
Corpus ID: 27680942
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
2010
2010
Fast and Space-Efficient Computation of Equi-Depth Histograms for Data Streams
Hamid Mousavi
,
C. Zaniolo
2010
Corpus ID: 18216863
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide…
Expand
2008
2008
A ug 2 00 6 On two biased graph processes
Gideon Amir
,
E. Lubetzky
2008
Corpus ID: 18445952
In [1], the authors consider the generalization G∨ K of the Erdős-Rényi random graph process G1, where instead of adding new…
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
2002
2002
Biased Graphs. VI. The Synthetic Geometry of Representations
2002
Corpus ID: 14433407
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