Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,668,847 papers from all fields of science
Search
Sign In
Create Free Account
Graph theory
Known as:
History of graph theory
, Graph
, GT
Expand
In mathematics graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Alexandru Balaban
B-coloring
Binary tree
Bridge (graph theory)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
A Fast Clustering-Based Feature Subset Selection Algorithm for High Dimensional Data
Yogesh R. Shepal
,
Ashraf Shaikh
2014
Corpus ID: 26858801
: Feature selection involves identifying a subset of the most useful features that produces compatible results as the original…
Expand
Highly Cited
2006
Highly Cited
2006
On the controlled agreement problem
A. Rahmani
,
M. Mesbahi
American Control Conference
2006
Corpus ID: 42011382
Our work examines the controlled agreement problem over a network of interconnected dynamic units. The agreement protocol has…
Expand
Highly Cited
2006
Highly Cited
2006
Power System Extreme Event Screening using Graph Partitioning
B. Lesieutre
,
S. Roy
,
V. Donde
,
Ali Pinar
North American Power Symposium
2006
Corpus ID: 17017239
We propose a partitioning problem in a power system context that weighs the two objectives of minimizing cuts between partitions…
Expand
Highly Cited
2004
Highly Cited
2004
A Path-based Transfer Model for Machine Translation
Dekang Lin
International Conference on Computational…
2004
Corpus ID: 3190906
We propose a path-based transfer model for machine translation. The model is trained with a word-aligned parallel corpus where…
Expand
Highly Cited
2004
Highly Cited
2004
A coordinated data collection approach: design, evaluation, and comparison
W. Cheng
,
Cheng-Fu Chou
,
L. Golubchik
,
S. Khuller
,
Yung-Chun Wan
IEEE Journal on Selected Areas in Communications
2004
Corpus ID: 8444371
We consider the problem of collecting a large amount of data from several different hosts to a single destination in a wide-area…
Expand
Highly Cited
2001
Highly Cited
2001
Optimal FPGA module placement with temporal precedence constraints
S. Fekete
,
Ekkehard Köhler
,
J. Teich
Proceedings Design, Automation and Test in Europe…
2001
Corpus ID: 9747276
We consider the optimal placement of hardware modules in space and time for FPGA architectures with reconfiguration capabilities…
Expand
Highly Cited
2000
Highly Cited
2000
IGRAINE-an Implication GRaph-bAsed engINE for fast implication, justification, and propagation
P. Tafertshofer
,
A. Ganz
,
K. Antreich
IEEE Trans. Comput. Aided Des. Integr. Circuits…
2000
Corpus ID: 5548644
Implication, justification, and propagation are three important Boolean problems that have to be solved during many tasks in…
Expand
Highly Cited
1999
Highly Cited
1999
An approach to partner selection in agile manufacturing
N. Wu
,
N. Mao
,
Yanming Qian
Journal of Intelligent Manufacturing
1999
Corpus ID: 2703719
It is believed that agile manufacturing is the twenty-first century manufacturing enterprise strategy and should be realized by…
Expand
Highly Cited
1992
Highly Cited
1992
An interactive layout heuristic based on hexagonal adjacency graphs
M. Goetschalckx
1992
Corpus ID: 62680199
Highly Cited
1983
Highly Cited
1983
An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints
Yuh-Zen Liao
,
Chak-Kuen Wong
IEEE Transactions on Computer-Aided Design of…
1983
Corpus ID: 47450428
A popular algorithm to compact VLSI symbolic layout is to use a graph algorithm similar to finding the "longest path" in a…
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