Skip to search formSkip to main contentSkip to account menu

Gain graph

Known as: Gain group 
A gain graph is a graph whose edges are labelled "invertibly", or "orientably", by elements of a group G. This means that, if an edge e in one… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Biased graphBicircular matroidCombinatorial optimizationDowling geometry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Enabling Real-Time Collaborative Brain-Mobile Interactive Applications on Volunteer Mobile Devices
Commercially available wearable brain sensors and devices that convert smartphones into virtual reality systems open up the… 
2015
2015
Maternal and Neonatal Outcomes among Obese Women with Gestational Weight Gain above the New Institute of Medicine (IOM) Recommendations
Objectives: Gestational weight gain is important for optimal maternal and neonatal outcomes. New Institute of Medicine (IOM… 
2011
2011
A Team Mental Model Perspective of Pre-Quantitative Risk
This study was conducted to better understand how teams conceptualize risk before it can be quantified, and the processes by… 
2011
2011
On Incentive Compatible Competitive Selection Protocols
The problem of selecting m best players out of n candidates, through pairwise comparisons, is considered. Deviating from the… 
2008
2008
Age trends in genetic parameters of wood density components in 46 half-sibling families of Pinus pinaster
This study contributes to the Pinus pinaster Ait. breeding programme, which is reaching the third generation by adding… 
2008
2008
Collaborative decision making
Through his leadership, the team was able to accomplish a tremendous volume of work. He has always been one of CDMs greatest… 
2008
2008
Design of piecewise linear LQ control for linear systems with actuator rate saturations using LMIs optimization
A model of the servomechanism used for high-powered actuators in mechanical systems consists of a position feedback loop around… 
2002
2002
TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
Minoux considered the manmum balanced /low problem, i.e. the problem of finding a maximum flow in a two-terminal network Af = (V… 
2002
2002
Criteria for Balance in Abelian Gain Graphs ∗
A gain graph (Γ, g, G) is a graph Γ = (V,E) together with a group G, the gain group, and a homomorphism g, the gain function… 
2002
2002
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups
We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each… 
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)