F Boesch - Concepedia

Author

F Boesch

Stevens Institute of Technology

Also Known As

F Boesch, F. Boesch, F. T. Boesch, F.T Boesch, F.T. Boesch, Frank Boesch, Frank T. Boesch, Robert Smith, Smith

100

Publications

2.3K

Citations

H-Index

Concepts

All Affiliations

Stevens Institute of Technology National Cheng Kung University TU Wien California State Polytechnic University University of Michigan

About

F Boesch is an author at Stevens Institute of Technology specializing in graph theory, engineering, and discrete mathematics.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	22	26	1.8K
2	Computer Science	14	15	964
3	Business	11	12	1K
4	Education	10	12	424
5	Computer Engineering	3	3	236

F Boesch

Publications

2.1K

Citations

H-Index

Page 1

	Year	Citations
Circulants and their connectivities F Boesch, Ralph Tindell Journal of Graph Theory Integral GeometryNetwork Theory (Electrical Engineering)Directed GraphEngineeringGeometry	1984	349
Synthesis of reliable networks - a survey F Boesch IEEE Transactions on Reliability EngineeringReliable NetworksNetwork RobustnessNetwork AnalysisSystem Reliability	1986	179
On unreliability polynomials and graph connectivity in reliable network synthesis F Boesch Journal of Graph Theory Network Theory (Electrical Engineering)EngineeringNetwork RobustnessNetwork AnalysisComputational Complexity	1986	131
Reliable circulant networks with minimum transmission delay F Boesch, Jhing-Fa Wang IEEE Transactions on Circuits and Systems EngineeringReliable Circulant NetworksNetwork RobustnessNetwork AnalysisSymmetric Graphs	1985	125
The spanning subgraphs of eulerian graphs F Boesch, C Suffel, Ralph Tindell Journal of Graph Theory Geometric Graph TheoryEulerian GraphsTrivial GraphGraph TheoryAlgebraic Graph Theory	1977	110
Robbins's Theorem for Mixed Multigraphs F Boesch, Ralph Tindell American Mathematical Monthly Mathematical ProgrammingImage Size AdditionalTechnologyEngineeringGraph Theory	1980	97
Spanning tree formulas and chebyshev polynomials F Boesch, Helmut Prodinger Graphs and Combinatorics Orthogonal PolynomialAnalytic CombinatoricsDiscrete MathematicsTree FormulasApproximation Theory	1986	92
On the existence of uniformly optimally reliable networks F Boesch, X. Li, C Suffel Networks Network Theory (Electrical Engineering)EngineeringReliable NetworksNetwork RobustnessNetwork Analysis	1991	85
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization F Boesch, James F. Gimpel Journal of the ACM Mathematical ProgrammingDirected GraphEngineeringPlanar GraphComputational Complexity	1977	82
Combinatorial optimization problems in the analysis and design of probabilistic networks Douglas C. Bauer, F Boesch, C Suffel, Networks Mathematical ProgrammingNetwork Theory (Electrical Engineering)Combinatorial Optimization ProblemsEngineeringReliable Networks	1985	80

Page 1