Concepedia

Stanley M. Selkow

SM

21

Publications

1.3K

Citations

15

H-Index

1972

Active since

Affiliations

Worcester Polytechnic Institute(Current)

Hungarian Academy of Sciences

Institute for Computer Science and Control

Alfréd Rényi Institute of Mathematics

Université de Montréal

Stanley M. Selkow is an author at Worcester Polytechnic Institute specializing in graph theory, discrete mathematics, and combinatorial optimization.

Top concepts

Graph TheoryDiscrete MathematicsCombinatorial OptimizationEducationNetwork AnalysisEngineeringComputer ScienceProbabilityNetwork ScienceAutomated Reasoning

Publications per year

1972–2013

21

Publications

21

The tree-to-tree editing problem

Stanley M. Selkow · Information Processing Letters · 1977 · 412 citations

Tree Language, Tree-to-tree Editing Problem, Engineering +5

Random Graph Isomorphism

László Babai, Paul Erdo ̋s, Stanley M. Selkow · SIAM Journal on Computing · 1980 · 305 citations

Engineering, Network Analysis, Education +17

Some perfect coloring properties of graphs

C. Christen, Stanley M. Selkow · Journal of Combinatorial Theory Series B · 1979 · 112 citations

Graph Theory, Algebraic Graph Theory, Topological Graph Theory +3

Ramsey‐type results for Gallai colorings

András Gyárfás, Gábor N. Sárközy, András Sebö et al. · Journal of Graph Theory · 2009 · 59 citations

Ramsey Numbers, Information Theory, Graph Theory +8

Cost-minimal trees in directed acyclic graphs

Ludwig Nastansky, Stanley M. Selkow, Nathaniel Stewart · Mathematical Methods of Operations Research · 1974 · 49 citations

Rows per page

1–5 of 21